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/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:20:08,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:20:08,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:20:08,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:20:08,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:20:08,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:20:08,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:20:08,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:20:08,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:20:08,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:20:08,689 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:20:08,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:20:08,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:20:08,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:20:08,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:20:08,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:20:08,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:20:08,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:20:08,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:20:08,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:20:08,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:20:08,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:20:08,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:20:08,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:20:08,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:20:08,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:20:08,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:20:08,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:20:08,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:20:08,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:20:08,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:20:08,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:20:08,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:20:08,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:20:08,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:20:08,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:20:08,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:20:08,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:20:08,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:20:08,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:20:08,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:20:08,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:20:08,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:20:08,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:20:08,779 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:20:08,780 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:20:08,781 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2019-08-05 10:20:08,781 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2019-08-05 10:20:08,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:20:08,828 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:20:08,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:20:08,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:20:08,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:20:08,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:20:08" (1/1) ... [2019-08-05 10:20:08,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:20:08" (1/1) ... [2019-08-05 10:20:08,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:20:08,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:20:08,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:20:08,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:20:08,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:20:08" (1/1) ... [2019-08-05 10:20:08,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:20:08" (1/1) ... [2019-08-05 10:20:08,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:20:08" (1/1) ... [2019-08-05 10:20:08,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:20:08" (1/1) ... [2019-08-05 10:20:08,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:20:08" (1/1) ... [2019-08-05 10:20:08,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:20:08" (1/1) ... [2019-08-05 10:20:08,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:20:08" (1/1) ... [2019-08-05 10:20:08,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:20:08,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:20:08,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:20:08,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:20:08,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:20:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:20:08,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:20:08,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:20:09,246 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:20:09,247 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-05 10:20:09,248 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:20:09 BoogieIcfgContainer [2019-08-05 10:20:09,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:20:09,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:20:09,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:20:09,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:20:09,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:20:08" (1/2) ... [2019-08-05 10:20:09,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4450d26 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:20:09, skipping insertion in model container [2019-08-05 10:20:09,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:20:09" (2/2) ... [2019-08-05 10:20:09,256 INFO L109 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2019-08-05 10:20:09,266 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:20:09,273 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:20:09,289 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:20:09,316 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:20:09,317 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:20:09,317 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:20:09,318 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:20:09,318 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:20:09,318 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:20:09,318 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:20:09,318 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:20:09,318 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:20:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:20:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:20:09,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:09,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:20:09,344 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:09,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:09,350 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-08-05 10:20:09,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:09,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:20:09,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:09,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:20:09,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:20:09,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:20:09,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:20:09,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:20:09,662 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 10:20:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:09,814 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-08-05 10:20:09,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:20:09,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:20:09,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:09,826 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:20:09,827 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:20:09,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:20:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:20:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:20:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:20:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:20:09,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-08-05 10:20:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:09,864 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:20:09,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:20:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:20:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:20:09,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:09,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:20:09,866 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:09,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-08-05 10:20:09,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:09,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:20:09,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:09,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:09,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:20:09,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:20:09,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:20:09,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:20:09,958 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 10:20:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:10,030 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 10:20:10,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:20:10,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:20:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:10,032 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:20:10,032 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:20:10,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:20:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:20:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:20:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:20:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:20:10,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:20:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:10,039 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:20:10,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:20:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:20:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:20:10,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:10,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:20:10,040 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:10,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:10,041 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-08-05 10:20:10,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:10,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:20:10,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:10,289 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 8 treesize of output 7 [2019-08-05 10:20:10,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:10,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:10,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:10,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:10,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:10,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:20:10,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:20:10,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:20:10,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:20:10,401 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 6 states. [2019-08-05 10:20:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:10,637 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-08-05 10:20:10,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:20:10,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:20:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:10,639 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:20:10,639 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:20:10,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:20:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:20:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:20:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:20:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 10:20:10,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-05 10:20:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:10,643 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 10:20:10,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:20:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 10:20:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:20:10,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:10,644 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:20:10,644 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:10,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2019-08-05 10:20:10,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:10,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:20:10,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:10,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:10,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:20:10,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:20:10,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:20:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:20:10,747 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-08-05 10:20:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:10,848 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 10:20:10,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:20:10,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:20:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:10,850 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:20:10,850 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:20:10,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:20:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:20:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:20:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:20:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:20:10,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-08-05 10:20:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:10,853 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:20:10,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:20:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:20:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:20:10,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:10,854 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 10:20:10,855 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2019-08-05 10:20:10,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:10,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:20:10,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:11,131 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 8 treesize of output 7 [2019-08-05 10:20:11,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:11,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:11,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:11,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:11,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:11,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:20:11,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:20:11,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:20:11,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:20:11,222 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 8 states. [2019-08-05 10:20:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:11,511 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-08-05 10:20:11,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:20:11,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:20:11,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:11,512 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:20:11,512 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:20:11,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:20:11,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:20:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:20:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:20:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 10:20:11,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2019-08-05 10:20:11,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:11,516 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 10:20:11,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:20:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 10:20:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:20:11,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:11,517 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2019-08-05 10:20:11,517 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:11,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:11,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1241268001, now seen corresponding path program 4 times [2019-08-05 10:20:11,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:11,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:20:11,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:11,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:11,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:20:11,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:20:11,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:20:11,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:20:11,732 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 6 states. [2019-08-05 10:20:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:11,816 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 10:20:11,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:20:11,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:20:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:11,817 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:20:11,817 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:20:11,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:20:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:20:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:20:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:20:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:20:11,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2019-08-05 10:20:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:11,820 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:20:11,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:20:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:20:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:20:11,821 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:11,821 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-05 10:20:11,822 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:11,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 5 times [2019-08-05 10:20:11,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:11,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:20:11,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:12,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 8 treesize of output 7 [2019-08-05 10:20:12,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:12,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:12,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:12,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:12,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:12,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:20:12,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:20:12,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:20:12,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:20:12,180 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2019-08-05 10:20:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:12,369 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-05 10:20:12,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:20:12,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:20:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:12,370 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:20:12,371 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:20:12,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:20:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:20:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:20:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:20:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 10:20:12,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-08-05 10:20:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:12,374 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 10:20:12,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:20:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 10:20:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:20:12,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:12,375 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-08-05 10:20:12,375 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:12,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:12,376 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 6 times [2019-08-05 10:20:12,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:12,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:20:12,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:12,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:12,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:20:12,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:20:12,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:20:12,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:20:12,507 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-08-05 10:20:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:12,642 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:20:12,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:20:12,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:20:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:12,644 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:20:12,644 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:20:12,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:20:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:20:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:20:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:20:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:20:12,647 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-08-05 10:20:12,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:12,648 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:20:12,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:20:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:20:12,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:20:12,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:12,649 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-08-05 10:20:12,649 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:12,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 7 times [2019-08-05 10:20:12,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:12,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:20:12,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:12,920 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 8 treesize of output 7 [2019-08-05 10:20:12,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:12,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:12,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:12,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:12,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:12,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:20:12,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:20:12,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:20:12,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:20:12,966 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 12 states. [2019-08-05 10:20:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:13,189 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-08-05 10:20:13,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:20:13,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:20:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:13,190 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:20:13,190 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:20:13,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:20:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:20:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:20:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:20:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 10:20:13,193 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-08-05 10:20:13,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:13,193 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 10:20:13,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:20:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 10:20:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:20:13,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:13,194 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2019-08-05 10:20:13,195 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:13,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:13,195 INFO L82 PathProgramCache]: Analyzing trace with hash -567121215, now seen corresponding path program 8 times [2019-08-05 10:20:13,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:13,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:20:13,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:13,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:13,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:20:13,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:20:13,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:20:13,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:20:13,418 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 8 states. [2019-08-05 10:20:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:13,493 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 10:20:13,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:20:13,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 10:20:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:13,495 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:20:13,495 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:20:13,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:20:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:20:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:20:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:20:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:20:13,499 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-08-05 10:20:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:13,499 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:20:13,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:20:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:20:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:20:13,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:13,500 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-08-05 10:20:13,501 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 9 times [2019-08-05 10:20:13,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:13,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:20:13,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:13,726 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 8 treesize of output 7 [2019-08-05 10:20:13,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:13,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:13,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:13,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:13,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:13,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:20:13,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:20:13,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:20:13,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:20:13,785 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 14 states. [2019-08-05 10:20:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:14,041 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-08-05 10:20:14,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:20:14,042 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:20:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:14,043 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:20:14,043 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:20:14,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:20:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:20:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:20:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:20:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 10:20:14,046 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-08-05 10:20:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:14,047 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 10:20:14,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:20:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 10:20:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:20:14,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:14,048 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-08-05 10:20:14,048 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:14,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 10 times [2019-08-05 10:20:14,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:14,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:20:14,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:14,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:14,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:20:14,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:20:14,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:20:14,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:20:14,186 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2019-08-05 10:20:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:14,523 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 10:20:14,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:20:14,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:20:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:14,525 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:20:14,525 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:20:14,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:20:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:20:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:20:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:20:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 10:20:14,529 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-08-05 10:20:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:14,530 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 10:20:14,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:20:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 10:20:14,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:20:14,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:14,531 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-08-05 10:20:14,531 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:14,531 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 11 times [2019-08-05 10:20:14,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:14,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:20:14,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:14,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-08-05 10:20:14,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:14,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:14,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:14,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:14,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:14,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:20:14,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:20:14,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:20:14,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:20:14,895 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 16 states. [2019-08-05 10:20:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:15,160 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-08-05 10:20:15,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:20:15,160 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:20:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:15,161 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:20:15,161 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:20:15,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:20:15,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:20:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:20:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:20:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-05 10:20:15,165 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2019-08-05 10:20:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:15,165 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-05 10:20:15,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:20:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-05 10:20:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:20:15,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:15,166 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2019-08-05 10:20:15,166 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:15,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1639932319, now seen corresponding path program 12 times [2019-08-05 10:20:15,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:15,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:20:15,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:15,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:15,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:20:15,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:20:15,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:20:15,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:20:15,372 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 10 states. [2019-08-05 10:20:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:15,750 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 10:20:15,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:20:15,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 10:20:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:15,752 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:20:15,752 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:20:15,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:20:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:20:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:20:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:20:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 10:20:15,756 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2019-08-05 10:20:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:15,756 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 10:20:15,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:20:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 10:20:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:20:15,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:15,757 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-08-05 10:20:15,757 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:15,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:15,758 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 13 times [2019-08-05 10:20:15,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:15,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:20:15,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:16,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 8 treesize of output 7 [2019-08-05 10:20:16,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:16,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:16,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:16,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:16,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:16,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:20:16,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:20:16,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:20:16,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:20:16,109 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 18 states. [2019-08-05 10:20:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:16,397 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-08-05 10:20:16,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:20:16,398 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:20:16,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:16,398 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:20:16,398 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:20:16,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:20:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:20:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:20:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:20:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-08-05 10:20:16,402 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-08-05 10:20:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:16,402 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-08-05 10:20:16,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:20:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-08-05 10:20:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:20:16,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:16,403 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-08-05 10:20:16,403 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:16,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:16,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 14 times [2019-08-05 10:20:16,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:16,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:20:16,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:16,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:16,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:20:16,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:20:16,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:20:16,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:20:16,672 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-08-05 10:20:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:16,856 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-08-05 10:20:16,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:20:16,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 10:20:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:16,859 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:20:16,859 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:20:16,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:20:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:20:16,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:20:16,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:20:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 10:20:16,862 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-08-05 10:20:16,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:16,863 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 10:20:16,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:20:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 10:20:16,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:20:16,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:16,864 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-08-05 10:20:16,864 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:16,864 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 15 times [2019-08-05 10:20:16,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:16,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:20:16,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:17,327 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 8 treesize of output 7 [2019-08-05 10:20:17,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:17,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:17,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:17,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:17,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:17,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:20:17,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:20:17,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:20:17,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:20:17,361 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 20 states. [2019-08-05 10:20:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:17,740 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-08-05 10:20:17,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:20:17,740 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:20:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:17,741 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:20:17,741 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:20:17,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=240, Invalid=572, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:20:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:20:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:20:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:20:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-05 10:20:17,745 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2019-08-05 10:20:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:17,745 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-05 10:20:17,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:20:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-05 10:20:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:20:17,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:17,746 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1] [2019-08-05 10:20:17,746 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:17,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:17,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1534273023, now seen corresponding path program 16 times [2019-08-05 10:20:17,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:17,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:20:17,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:18,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:18,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:20:18,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:20:18,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:20:18,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:20:18,106 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2019-08-05 10:20:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:18,228 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 10:20:18,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:20:18,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 10:20:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:18,230 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:20:18,230 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:20:18,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:20:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:20:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:20:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:20:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-05 10:20:18,235 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2019-08-05 10:20:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:18,235 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-05 10:20:18,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:20:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-05 10:20:18,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:20:18,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:18,236 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-08-05 10:20:18,237 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:18,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:18,237 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 17 times [2019-08-05 10:20:18,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:18,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:20:18,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:18,565 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 8 treesize of output 7 [2019-08-05 10:20:18,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:18,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:18,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:18,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:18,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:18,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:20:18,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:20:18,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:20:18,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:20:18,594 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 22 states. [2019-08-05 10:20:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:18,999 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-08-05 10:20:18,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:20:18,999 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:20:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:19,000 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:20:19,000 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:20:19,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:20:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:20:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:20:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:20:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-08-05 10:20:19,003 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-08-05 10:20:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:19,003 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-08-05 10:20:19,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:20:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-08-05 10:20:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:20:19,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:19,004 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-08-05 10:20:19,004 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:19,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:19,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 18 times [2019-08-05 10:20:19,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:19,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:20:19,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:19,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:19,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:20:19,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:20:19,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:20:19,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:20:19,125 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2019-08-05 10:20:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:19,289 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 10:20:19,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:20:19,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-08-05 10:20:19,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:19,290 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:20:19,291 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:20:19,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:20:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:20:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:20:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:20:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 10:20:19,295 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-08-05 10:20:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:19,295 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 10:20:19,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:20:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 10:20:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:20:19,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:19,296 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-08-05 10:20:19,296 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:19,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 19 times [2019-08-05 10:20:19,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:19,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:20:19,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:19,735 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 8 treesize of output 7 [2019-08-05 10:20:19,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:19,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:19,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:19,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:19,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:19,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:20:19,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:20:19,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:20:19,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:20:19,763 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 24 states. [2019-08-05 10:20:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:20,167 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-08-05 10:20:20,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:20:20,167 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:20:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:20,168 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:20:20,168 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:20:20,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=839, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:20:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:20:20,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:20:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:20:20,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-08-05 10:20:20,171 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2019-08-05 10:20:20,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:20,171 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-08-05 10:20:20,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:20:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-08-05 10:20:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:20:20,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:20,172 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1] [2019-08-05 10:20:20,172 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:20,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:20,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1510138463, now seen corresponding path program 20 times [2019-08-05 10:20:20,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:20,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:20:20,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:20,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:20,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:20:20,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:20:20,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:20:20,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:20:20,410 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 14 states. [2019-08-05 10:20:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:20,718 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-08-05 10:20:20,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:20:20,720 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-08-05 10:20:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:20,721 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:20:20,721 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:20:20,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:20:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:20:20,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:20:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:20:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 10:20:20,725 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2019-08-05 10:20:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:20,725 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 10:20:20,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:20:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 10:20:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:20:20,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:20,726 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-08-05 10:20:20,726 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:20,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 21 times [2019-08-05 10:20:20,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:20,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:20:20,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:21,855 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 8 treesize of output 7 [2019-08-05 10:20:21,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:21,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:21,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:21,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:21,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:21,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:20:21,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:20:21,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:20:21,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:20:21,893 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 26 states. [2019-08-05 10:20:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:22,368 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-08-05 10:20:22,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:20:22,369 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:20:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:22,369 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:20:22,369 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:20:22,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=414, Invalid=992, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:20:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:20:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:20:22,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:20:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-08-05 10:20:22,374 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-08-05 10:20:22,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:22,375 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-08-05 10:20:22,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:20:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-08-05 10:20:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:20:22,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:22,376 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-08-05 10:20:22,376 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:22,376 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 22 times [2019-08-05 10:20:22,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:22,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:20:22,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:22,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:22,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:20:22,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:20:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:20:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:20:22,511 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2019-08-05 10:20:22,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:22,750 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-08-05 10:20:22,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:20:22,751 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-08-05 10:20:22,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:22,751 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:20:22,752 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:20:22,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:20:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:20:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:20:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:20:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-05 10:20:22,756 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2019-08-05 10:20:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:22,756 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-05 10:20:22,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:20:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-05 10:20:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:20:22,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:22,757 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-08-05 10:20:22,757 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:22,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:22,757 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 23 times [2019-08-05 10:20:22,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:22,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:20:22,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:23,464 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 8 treesize of output 7 [2019-08-05 10:20:23,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:23,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:23,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:23,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:23,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:23,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:20:23,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:20:23,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:20:23,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:20:23,499 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 28 states. [2019-08-05 10:20:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:24,416 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-08-05 10:20:24,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:20:24,416 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:20:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:24,417 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:20:24,417 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:20:24,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=482, Invalid=1158, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:20:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:20:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:20:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:20:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-08-05 10:20:24,421 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2019-08-05 10:20:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:24,421 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-08-05 10:20:24,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:20:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-08-05 10:20:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:20:24,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:24,422 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1] [2019-08-05 10:20:24,422 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:24,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1375168833, now seen corresponding path program 24 times [2019-08-05 10:20:24,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:24,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:20:24,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 78 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:25,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:25,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:20:25,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:20:25,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:20:25,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:20:25,028 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2019-08-05 10:20:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:25,273 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 10:20:25,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:20:25,273 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-08-05 10:20:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:25,274 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:20:25,274 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:20:25,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:20:25,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:20:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:20:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:20:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 10:20:25,278 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2019-08-05 10:20:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:25,278 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 10:20:25,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:20:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 10:20:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:20:25,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:25,279 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-08-05 10:20:25,279 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:25,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:25,279 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 25 times [2019-08-05 10:20:25,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:25,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:20:25,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:26,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-08-05 10:20:26,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:26,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:26,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:26,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:26,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:26,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:20:26,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:20:26,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:20:26,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:20:26,221 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 30 states. [2019-08-05 10:20:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:26,784 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-08-05 10:20:26,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:20:26,785 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:20:26,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:26,785 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:20:26,785 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:20:26,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=555, Invalid=1337, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:20:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:20:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:20:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:20:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-08-05 10:20:26,789 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-08-05 10:20:26,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:26,789 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-08-05 10:20:26,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:20:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-08-05 10:20:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:20:26,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:26,792 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2019-08-05 10:20:26,792 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:26,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:26,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 26 times [2019-08-05 10:20:26,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:26,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:20:26,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:27,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:27,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:20:27,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:20:27,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:20:27,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:20:27,137 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2019-08-05 10:20:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:27,580 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-05 10:20:27,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:20:27,581 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-08-05 10:20:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:27,581 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:20:27,581 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:20:27,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:20:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:20:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:20:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:20:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-05 10:20:27,584 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-08-05 10:20:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:27,584 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-05 10:20:27,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:20:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-05 10:20:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:20:27,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:27,585 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-08-05 10:20:27,586 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:27,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:27,586 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 27 times [2019-08-05 10:20:27,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:27,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:20:27,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:28,104 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 8 treesize of output 7 [2019-08-05 10:20:28,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:28,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:28,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:28,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:28,145 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-05 10:20:28,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:28,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:20:28,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:20:28,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:20:28,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=722, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:20:28,146 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 32 states. [2019-08-05 10:20:28,651 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 10:20:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:29,301 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-08-05 10:20:29,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:20:29,302 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:20:29,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:29,302 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:20:29,303 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:20:29,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=642, Invalid=1520, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:20:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:20:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:20:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:20:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-08-05 10:20:29,307 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2019-08-05 10:20:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:29,307 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-08-05 10:20:29,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:20:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-08-05 10:20:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:20:29,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:29,308 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1] [2019-08-05 10:20:29,309 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:29,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:29,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1302217503, now seen corresponding path program 28 times [2019-08-05 10:20:29,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:29,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:20:29,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 105 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:30,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:30,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:20:30,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:20:30,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:20:30,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:20:30,010 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 18 states. [2019-08-05 10:20:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:30,214 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-05 10:20:30,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:20:30,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-08-05 10:20:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:30,215 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:20:30,215 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:20:30,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:20:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:20:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:20:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:20:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-05 10:20:30,218 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 33 [2019-08-05 10:20:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:30,219 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-05 10:20:30,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:20:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-05 10:20:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:20:30,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:30,219 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-08-05 10:20:30,220 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:30,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 29 times [2019-08-05 10:20:30,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:30,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:20:30,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:30,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-08-05 10:20:30,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:30,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:30,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:30,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:30,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:30,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:20:30,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:20:30,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:20:30,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=818, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:20:30,987 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 34 states. [2019-08-05 10:20:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:31,738 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-08-05 10:20:31,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:20:31,738 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:20:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:31,739 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:20:31,739 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:20:31,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=725, Invalid=1725, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:20:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:20:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:20:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:20:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-08-05 10:20:31,756 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-08-05 10:20:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:31,757 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-08-05 10:20:31,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:20:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-08-05 10:20:31,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:20:31,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:31,758 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2019-08-05 10:20:31,758 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:31,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:31,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 30 times [2019-08-05 10:20:31,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:31,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:20:31,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:31,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:31,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:20:31,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:20:31,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:20:31,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:20:31,959 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2019-08-05 10:20:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:32,188 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-05 10:20:32,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:20:32,188 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-08-05 10:20:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:32,189 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:20:32,189 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:20:32,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:20:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:20:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:20:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:20:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-05 10:20:32,193 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-08-05 10:20:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:32,193 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-05 10:20:32,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:20:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-05 10:20:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:20:32,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:32,194 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-08-05 10:20:32,195 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 31 times [2019-08-05 10:20:32,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:32,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:20:32,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:32,740 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 8 treesize of output 7 [2019-08-05 10:20:32,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:32,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:32,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:32,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:32,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:32,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:20:32,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:20:32,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:20:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=923, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:20:32,779 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 36 states. [2019-08-05 10:20:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:33,576 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-08-05 10:20:33,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:20:33,576 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:20:33,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:33,576 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:20:33,576 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:20:33,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=804, Invalid=1952, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:20:33,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:20:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:20:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:20:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-08-05 10:20:33,580 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2019-08-05 10:20:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:33,580 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-08-05 10:20:33,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:20:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-08-05 10:20:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:20:33,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:33,581 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1] [2019-08-05 10:20:33,581 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:33,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:33,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1952311167, now seen corresponding path program 32 times [2019-08-05 10:20:33,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:33,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:20:33,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 136 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:33,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:33,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:20:33,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:20:33,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:20:33,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:20:33,777 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 20 states. [2019-08-05 10:20:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:34,045 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-08-05 10:20:34,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:20:34,045 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-08-05 10:20:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:34,046 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:20:34,046 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:20:34,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:20:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:20:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:20:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:20:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-05 10:20:34,049 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2019-08-05 10:20:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:34,050 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-05 10:20:34,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:20:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-05 10:20:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:20:34,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:34,050 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-08-05 10:20:34,051 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:34,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:34,051 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 33 times [2019-08-05 10:20:34,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:34,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:20:34,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:34,739 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 8 treesize of output 7 [2019-08-05 10:20:34,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:34,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:34,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:34,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:34,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:34,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:20:34,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:20:34,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:20:34,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1031, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:20:34,774 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 38 states. [2019-08-05 10:20:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:35,602 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-08-05 10:20:35,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:20:35,603 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:20:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:35,603 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:20:35,603 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:20:35,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=897, Invalid=2183, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:20:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:20:35,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:20:35,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:20:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-08-05 10:20:35,606 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-08-05 10:20:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:35,607 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-08-05 10:20:35,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:20:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-08-05 10:20:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:20:35,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:35,608 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2019-08-05 10:20:35,608 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:35,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:35,608 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 34 times [2019-08-05 10:20:35,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:35,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:20:35,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:36,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:36,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:20:36,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:20:36,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:20:36,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:20:36,128 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2019-08-05 10:20:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:36,431 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-08-05 10:20:36,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:20:36,431 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-08-05 10:20:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:36,432 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:20:36,432 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:20:36,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:20:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:20:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:20:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:20:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-05 10:20:36,435 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-08-05 10:20:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:36,435 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-05 10:20:36,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:20:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-05 10:20:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:20:36,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:36,436 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-08-05 10:20:36,436 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:36,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:36,437 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 35 times [2019-08-05 10:20:36,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:36,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:20:36,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:37,142 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 8 treesize of output 7 [2019-08-05 10:20:37,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:37,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:37,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:37,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:37,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:37,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:20:37,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:20:37,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:20:37,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=1145, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:20:37,179 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 40 states. [2019-08-05 10:20:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:38,260 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-08-05 10:20:38,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:20:38,261 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:20:38,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:38,261 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:20:38,261 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:20:38,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=995, Invalid=2427, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:20:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:20:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:20:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:20:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-08-05 10:20:38,264 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2019-08-05 10:20:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:38,264 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-08-05 10:20:38,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:20:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-08-05 10:20:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:20:38,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:38,265 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1] [2019-08-05 10:20:38,265 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:38,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:38,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1130464223, now seen corresponding path program 36 times [2019-08-05 10:20:38,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:38,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:20:38,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 171 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:38,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:38,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:20:38,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:20:38,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:20:38,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:20:38,717 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 22 states. [2019-08-05 10:20:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:39,014 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 10:20:39,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:20:39,015 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-08-05 10:20:39,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:39,015 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:20:39,016 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:20:39,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:20:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:20:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:20:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:20:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-05 10:20:39,018 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2019-08-05 10:20:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:39,019 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-05 10:20:39,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:20:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-05 10:20:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:20:39,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:39,020 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-08-05 10:20:39,020 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:39,020 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 37 times [2019-08-05 10:20:39,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:39,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:20:39,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:39,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-08-05 10:20:39,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:39,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:39,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:39,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:39,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:39,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:20:39,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:20:39,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:20:39,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1265, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:20:39,972 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 42 states. [2019-08-05 10:20:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:41,035 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-08-05 10:20:41,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:20:41,035 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:20:41,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:41,036 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:20:41,036 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:20:41,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1098, Invalid=2684, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:20:41,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:20:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:20:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:20:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-08-05 10:20:41,039 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-08-05 10:20:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:41,039 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-08-05 10:20:41,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:20:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-08-05 10:20:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:20:41,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:41,039 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2019-08-05 10:20:41,039 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 38 times [2019-08-05 10:20:41,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:41,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:20:41,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:41,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:41,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:20:41,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:20:41,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:20:41,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:20:41,820 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2019-08-05 10:20:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:42,126 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-08-05 10:20:42,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:20:42,127 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-08-05 10:20:42,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:42,128 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:20:42,128 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:20:42,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:20:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:20:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:20:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:20:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-05 10:20:42,131 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2019-08-05 10:20:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:42,131 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-05 10:20:42,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:20:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-05 10:20:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:20:42,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:42,131 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-08-05 10:20:42,132 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:42,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:42,132 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 39 times [2019-08-05 10:20:42,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:42,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:20:42,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:42,900 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 8 treesize of output 7 [2019-08-05 10:20:42,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:42,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:42,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:42,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:42,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:42,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:20:42,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:20:42,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:20:42,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=1391, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:20:42,939 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 44 states. [2019-08-05 10:20:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:44,057 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-08-05 10:20:44,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:20:44,057 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:20:44,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:44,058 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:20:44,058 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:20:44,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1206, Invalid=2954, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:20:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:20:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:20:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:20:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-08-05 10:20:44,061 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2019-08-05 10:20:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:44,061 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-08-05 10:20:44,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:20:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-08-05 10:20:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:20:44,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:44,062 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1] [2019-08-05 10:20:44,062 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1631787071, now seen corresponding path program 40 times [2019-08-05 10:20:44,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:44,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:20:44,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 210 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:44,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:44,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:20:44,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:20:44,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:20:44,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:20:44,951 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 24 states. [2019-08-05 10:20:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:45,267 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-08-05 10:20:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:20:45,267 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-08-05 10:20:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:45,268 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:20:45,268 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:20:45,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:20:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:20:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:20:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:20:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-08-05 10:20:45,270 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 45 [2019-08-05 10:20:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:45,271 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-08-05 10:20:45,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:20:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-08-05 10:20:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:20:45,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:45,271 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-08-05 10:20:45,272 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 41 times [2019-08-05 10:20:45,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:45,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:20:45,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:46,418 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 8 treesize of output 7 [2019-08-05 10:20:46,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:46,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:46,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:46,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:46,459 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:46,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:46,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:20:46,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:20:46,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:20:46,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=1523, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:20:46,461 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 46 states. [2019-08-05 10:20:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:47,548 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-08-05 10:20:47,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:20:47,548 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:20:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:47,549 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:20:47,549 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:20:47,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1319, Invalid=3237, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:20:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:20:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:20:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:20:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-08-05 10:20:47,552 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-08-05 10:20:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:47,552 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-08-05 10:20:47,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:20:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-08-05 10:20:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:20:47,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:47,553 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2019-08-05 10:20:47,553 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 42 times [2019-08-05 10:20:47,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:47,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:20:47,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:47,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:47,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:20:47,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:20:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:20:47,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:20:47,889 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2019-08-05 10:20:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:48,215 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-05 10:20:48,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:20:48,216 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-08-05 10:20:48,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:48,216 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:20:48,216 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:20:48,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:20:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:20:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:20:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:20:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-05 10:20:48,219 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-08-05 10:20:48,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:48,219 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-05 10:20:48,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:20:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-05 10:20:48,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:20:48,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:48,220 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-08-05 10:20:48,221 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:48,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:48,221 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 43 times [2019-08-05 10:20:48,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:48,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:20:48,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:49,093 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 8 treesize of output 7 [2019-08-05 10:20:49,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:49,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:49,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:49,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:49,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:49,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:20:49,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:20:49,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:20:49,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1661, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:20:49,132 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 48 states. [2019-08-05 10:20:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:50,358 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-08-05 10:20:50,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:20:50,358 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:20:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:50,359 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:20:50,359 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:20:50,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1437, Invalid=3533, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:20:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:20:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:20:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:20:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-08-05 10:20:50,362 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 48 [2019-08-05 10:20:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:50,362 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-08-05 10:20:50,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:20:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-08-05 10:20:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:20:50,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:50,363 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1] [2019-08-05 10:20:50,363 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:50,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1709398881, now seen corresponding path program 44 times [2019-08-05 10:20:50,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:50,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:20:50,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 253 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:50,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:50,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:20:50,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:20:50,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:20:50,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:20:50,847 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 26 states. [2019-08-05 10:20:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:51,408 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-08-05 10:20:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:20:51,409 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-08-05 10:20:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:51,410 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:20:51,410 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:20:51,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:20:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:20:51,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:20:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:20:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-05 10:20:51,412 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 49 [2019-08-05 10:20:51,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:51,413 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-05 10:20:51,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:20:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-05 10:20:51,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:20:51,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:51,413 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-08-05 10:20:51,414 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:51,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:51,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 45 times [2019-08-05 10:20:51,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:51,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:20:51,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:52,636 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 8 treesize of output 7 [2019-08-05 10:20:52,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:52,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:52,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:52,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:52,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:52,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:20:52,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:20:52,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:20:52,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=1805, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:20:52,699 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 50 states. [2019-08-05 10:20:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:54,015 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-08-05 10:20:54,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:20:54,015 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:20:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:54,016 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:20:54,016 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:20:54,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1560, Invalid=3842, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:20:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:20:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:20:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:20:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-08-05 10:20:54,018 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-08-05 10:20:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:54,019 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-08-05 10:20:54,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:20:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-08-05 10:20:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:20:54,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:54,019 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2019-08-05 10:20:54,019 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:54,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:54,020 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 46 times [2019-08-05 10:20:54,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:54,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:20:54,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:54,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:54,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:20:54,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:20:54,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:20:54,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:20:54,321 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2019-08-05 10:20:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:54,674 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-05 10:20:54,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:20:54,675 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-08-05 10:20:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:54,675 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:20:54,676 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:20:54,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:20:54,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:20:54,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:20:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:20:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-08-05 10:20:54,679 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2019-08-05 10:20:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:54,679 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-08-05 10:20:54,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:20:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-08-05 10:20:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:20:54,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:54,680 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-08-05 10:20:54,680 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:54,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 47 times [2019-08-05 10:20:54,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:54,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:20:54,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:55,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 8 treesize of output 7 [2019-08-05 10:20:55,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:55,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:55,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:55,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:55,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:55,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:20:55,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:20:55,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:20:55,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=1955, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:20:55,707 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 52 states. [2019-08-05 10:20:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:57,305 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-08-05 10:20:57,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:20:57,306 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:20:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:57,307 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:20:57,307 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:20:57,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1688, Invalid=4164, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:20:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:20:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:20:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:20:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-08-05 10:20:57,310 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 52 [2019-08-05 10:20:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:57,310 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-08-05 10:20:57,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:20:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-08-05 10:20:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:20:57,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:57,311 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1] [2019-08-05 10:20:57,311 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:57,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:57,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2139629823, now seen corresponding path program 48 times [2019-08-05 10:20:57,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:57,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:20:57,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 300 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:57,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:57,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:20:57,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:20:57,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:20:57,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:20:57,876 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 28 states. [2019-08-05 10:20:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:58,264 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-05 10:20:58,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:20:58,264 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-08-05 10:20:58,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:58,265 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:20:58,265 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:20:58,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:20:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:20:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:20:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:20:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-05 10:20:58,268 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2019-08-05 10:20:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:58,269 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-05 10:20:58,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:20:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-05 10:20:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:20:58,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:58,269 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-08-05 10:20:58,269 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:58,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:58,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 49 times [2019-08-05 10:20:58,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:58,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:20:58,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:59,364 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 8 treesize of output 7 [2019-08-05 10:20:59,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:20:59,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:20:59,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:20:59,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:20:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:59,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:59,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:20:59,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:20:59,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:20:59,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=2111, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:20:59,497 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 54 states. [2019-08-05 10:21:01,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:01,032 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-08-05 10:21:01,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:21:01,033 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:21:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:01,034 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:21:01,034 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:21:01,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1821, Invalid=4499, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:21:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:21:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:21:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:21:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-08-05 10:21:01,037 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-08-05 10:21:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:01,037 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-08-05 10:21:01,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:21:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-08-05 10:21:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:21:01,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:01,038 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2019-08-05 10:21:01,038 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:01,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:01,039 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 50 times [2019-08-05 10:21:01,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:01,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:21:01,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:01,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:01,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:21:01,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:21:01,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:21:01,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:21:01,483 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2019-08-05 10:21:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:02,208 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-08-05 10:21:02,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:21:02,208 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-08-05 10:21:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:02,209 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:21:02,209 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:21:02,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:21:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:21:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:21:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:21:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-05 10:21:02,212 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2019-08-05 10:21:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:02,212 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-05 10:21:02,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:21:02,212 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-05 10:21:02,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:21:02,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:02,213 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-08-05 10:21:02,213 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:02,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:02,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 51 times [2019-08-05 10:21:02,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:02,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:21:02,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:05,264 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 8 treesize of output 7 [2019-08-05 10:21:05,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:21:05,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:21:05,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:21:05,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:21:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:05,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:05,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:21:05,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:21:05,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:21:05,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=2273, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:21:05,313 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 56 states. [2019-08-05 10:21:07,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:07,168 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-08-05 10:21:07,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:21:07,168 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:21:07,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:07,169 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:21:07,169 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:21:07,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1959, Invalid=4847, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:21:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:21:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:21:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:21:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-08-05 10:21:07,172 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2019-08-05 10:21:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:07,172 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-08-05 10:21:07,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:21:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-08-05 10:21:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:21:07,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:07,173 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1] [2019-08-05 10:21:07,173 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:07,173 INFO L82 PathProgramCache]: Analyzing trace with hash -144680287, now seen corresponding path program 52 times [2019-08-05 10:21:07,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:07,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:21:07,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 351 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:07,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:07,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:21:07,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:21:07,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:21:07,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:21:07,632 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 30 states. [2019-08-05 10:21:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:08,331 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-08-05 10:21:08,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:21:08,332 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-08-05 10:21:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:08,333 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:21:08,333 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:21:08,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:21:08,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:21:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:21:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:21:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-05 10:21:08,336 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 57 [2019-08-05 10:21:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:08,336 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-05 10:21:08,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:21:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-05 10:21:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:21:08,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:08,337 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-08-05 10:21:08,337 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 53 times [2019-08-05 10:21:08,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:08,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:21:08,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:09,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 8 treesize of output 7 [2019-08-05 10:21:09,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:21:09,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:21:09,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:21:09,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:21:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:09,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:09,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:21:09,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:21:09,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:21:09,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=2441, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:21:09,582 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 58 states. [2019-08-05 10:21:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:11,283 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-08-05 10:21:11,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:21:11,284 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:21:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:11,284 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:21:11,284 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:21:11,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2102, Invalid=5208, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:21:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:21:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:21:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:21:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-08-05 10:21:11,287 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-08-05 10:21:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:11,288 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-08-05 10:21:11,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:21:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-08-05 10:21:11,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:21:11,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:11,289 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2019-08-05 10:21:11,289 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:11,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:11,289 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 54 times [2019-08-05 10:21:11,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:11,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:21:11,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:12,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:12,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:21:12,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:21:12,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:21:12,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:21:12,235 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2019-08-05 10:21:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:12,728 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-08-05 10:21:12,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:21:12,794 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-08-05 10:21:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:12,795 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:21:12,795 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:21:12,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:21:12,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:21:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:21:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:21:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-05 10:21:12,797 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-08-05 10:21:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:12,797 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-05 10:21:12,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:21:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-05 10:21:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:21:12,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:12,799 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-08-05 10:21:12,799 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:12,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:12,799 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 55 times [2019-08-05 10:21:12,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:12,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-05 10:21:12,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:14,065 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 8 treesize of output 7 [2019-08-05 10:21:14,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:21:14,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:21:14,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:21:14,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:21:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:14,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:14,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:21:14,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:21:14,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:21:14,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=925, Invalid=2615, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:21:14,114 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 60 states. [2019-08-05 10:21:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:16,037 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-08-05 10:21:16,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:21:16,037 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:21:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:16,038 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:21:16,038 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:21:16,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2250, Invalid=5582, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:21:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:21:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:21:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:21:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-08-05 10:21:16,041 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 60 [2019-08-05 10:21:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:16,041 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-08-05 10:21:16,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:21:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-08-05 10:21:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:21:16,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:16,042 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1] [2019-08-05 10:21:16,042 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash -838670783, now seen corresponding path program 56 times [2019-08-05 10:21:16,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:16,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:21:16,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 406 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:16,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:16,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:21:16,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:21:16,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:21:16,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:21:16,518 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 32 states. [2019-08-05 10:21:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:17,304 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-05 10:21:17,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:21:17,304 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-08-05 10:21:17,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:17,305 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:21:17,305 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:21:17,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:21:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:21:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:21:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:21:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-05 10:21:17,308 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 61 [2019-08-05 10:21:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:17,309 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-05 10:21:17,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:21:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-05 10:21:17,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:21:17,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:17,310 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-08-05 10:21:17,310 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:17,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:17,310 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 57 times [2019-08-05 10:21:17,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:17,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 10:21:17,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:18,609 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 8 treesize of output 7 [2019-08-05 10:21:18,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:21:18,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:21:18,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:21:18,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:21:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:18,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:18,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:21:18,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:21:18,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:21:18,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=987, Invalid=2795, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:21:18,660 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 62 states. [2019-08-05 10:21:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:20,588 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2019-08-05 10:21:20,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:21:20,588 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:21:20,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:20,589 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:21:20,589 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:21:20,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2105 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2403, Invalid=5969, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:21:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:21:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:21:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:21:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-08-05 10:21:20,592 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-08-05 10:21:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:20,592 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-08-05 10:21:20,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:21:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-08-05 10:21:20,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:21:20,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:20,593 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2019-08-05 10:21:20,593 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:20,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:20,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 58 times [2019-08-05 10:21:20,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:20,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:21:20,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:21,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:21,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:21:21,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:21:21,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:21:21,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:21:21,154 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2019-08-05 10:21:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:21,679 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-08-05 10:21:21,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:21:21,680 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-08-05 10:21:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:21,681 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:21:21,681 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:21:21,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:21:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:21:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:21:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:21:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-08-05 10:21:21,685 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2019-08-05 10:21:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:21,685 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-08-05 10:21:21,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:21:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-08-05 10:21:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:21:21,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:21,685 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-08-05 10:21:21,685 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:21,686 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 59 times [2019-08-05 10:21:21,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:21,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:21:21,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:23,385 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 8 treesize of output 7 [2019-08-05 10:21:23,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:21:23,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:21:23,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:21:23,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:21:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:23,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:23,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:21:23,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:21:23,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:21:23,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1051, Invalid=2981, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:21:23,439 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 64 states. [2019-08-05 10:21:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:25,650 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2019-08-05 10:21:25,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:21:25,650 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:21:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:25,651 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:21:25,651 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:21:25,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2253 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2561, Invalid=6369, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:21:25,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:21:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:21:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:21:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-08-05 10:21:25,654 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 64 [2019-08-05 10:21:25,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:25,655 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-08-05 10:21:25,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:21:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-08-05 10:21:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:21:25,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:25,655 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1] [2019-08-05 10:21:25,656 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:25,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:25,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1648720353, now seen corresponding path program 60 times [2019-08-05 10:21:25,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:25,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:21:25,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 465 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:26,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:26,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:21:26,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:21:26,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:21:26,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:21:26,143 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 34 states. [2019-08-05 10:21:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:26,710 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-08-05 10:21:26,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:21:26,710 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2019-08-05 10:21:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:26,711 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:21:26,711 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:21:26,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:21:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:21:26,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:21:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:21:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-05 10:21:26,714 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2019-08-05 10:21:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:26,714 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-05 10:21:26,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:21:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-05 10:21:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:21:26,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:26,715 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-08-05 10:21:26,715 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:26,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:26,715 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 61 times [2019-08-05 10:21:26,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:26,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-05 10:21:26,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:28,570 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 8 treesize of output 7 [2019-08-05 10:21:28,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:21:28,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:21:28,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:21:28,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:21:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:28,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:28,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:21:28,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:21:28,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:21:28,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1117, Invalid=3173, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:21:28,624 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 66 states. [2019-08-05 10:21:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:30,847 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-08-05 10:21:30,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:21:30,848 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:21:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:30,848 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:21:30,848 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:21:30,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2406 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2724, Invalid=6782, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:21:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:21:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:21:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:21:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-08-05 10:21:30,851 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-08-05 10:21:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:30,851 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-08-05 10:21:30,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:21:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-08-05 10:21:30,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:21:30,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:30,851 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2019-08-05 10:21:30,852 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:30,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 62 times [2019-08-05 10:21:30,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:30,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:21:30,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:31,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:31,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:21:31,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:21:31,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:21:31,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:21:31,402 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2019-08-05 10:21:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:32,018 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-08-05 10:21:32,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:21:32,019 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-08-05 10:21:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:32,019 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:21:32,020 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:21:32,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:21:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:21:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:21:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:21:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-05 10:21:32,023 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2019-08-05 10:21:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:32,023 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-05 10:21:32,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:21:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-05 10:21:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:21:32,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:32,024 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-08-05 10:21:32,024 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:32,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:32,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 63 times [2019-08-05 10:21:32,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:32,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 10:21:32,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:34,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-08-05 10:21:34,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:21:34,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:21:34,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:21:34,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:21:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:34,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:34,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:21:34,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:21:34,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:21:34,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1185, Invalid=3371, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:21:34,291 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 68 states. [2019-08-05 10:21:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:36,614 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-08-05 10:21:36,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:21:36,615 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:21:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:36,616 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:21:36,616 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:21:36,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2564 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2892, Invalid=7208, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:21:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:21:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:21:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:21:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-08-05 10:21:36,618 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2019-08-05 10:21:36,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:36,618 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-08-05 10:21:36,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:21:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-08-05 10:21:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:21:36,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:36,619 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1] [2019-08-05 10:21:36,619 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:36,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:36,620 INFO L82 PathProgramCache]: Analyzing trace with hash -863103615, now seen corresponding path program 64 times [2019-08-05 10:21:36,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:36,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:21:36,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:37,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 528 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:37,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:37,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:21:37,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:21:37,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:21:37,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:21:37,937 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 36 states. [2019-08-05 10:21:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:38,607 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-08-05 10:21:38,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:21:38,608 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2019-08-05 10:21:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:38,609 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:21:38,609 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:21:38,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:21:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:21:38,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:21:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:21:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-08-05 10:21:38,612 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 69 [2019-08-05 10:21:38,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:38,612 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-08-05 10:21:38,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:21:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-08-05 10:21:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:21:38,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:38,613 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-08-05 10:21:38,613 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 65 times [2019-08-05 10:21:38,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:38,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:21:38,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:40,657 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 8 treesize of output 7 [2019-08-05 10:21:40,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:21:40,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:21:40,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:21:40,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:21:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:40,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:40,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:21:40,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:21:40,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:21:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1255, Invalid=3575, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:21:40,722 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 70 states. [2019-08-05 10:21:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:43,378 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2019-08-05 10:21:43,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:21:43,378 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:21:43,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:43,379 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:21:43,379 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:21:43,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2727 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3065, Invalid=7647, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:21:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:21:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:21:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:21:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-08-05 10:21:43,382 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-08-05 10:21:43,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:43,382 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-08-05 10:21:43,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:21:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-08-05 10:21:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:21:43,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:43,383 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2019-08-05 10:21:43,383 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:43,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:43,383 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 66 times [2019-08-05 10:21:43,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:43,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:21:43,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:44,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:44,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:21:44,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:21:44,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:21:44,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:21:44,234 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2019-08-05 10:21:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:44,917 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-05 10:21:44,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:21:44,918 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-08-05 10:21:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:44,919 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:21:44,919 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:21:44,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:21:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:21:44,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:21:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:21:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-05 10:21:44,922 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-08-05 10:21:44,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:44,922 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-05 10:21:44,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:21:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-05 10:21:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:21:44,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:44,923 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-08-05 10:21:44,923 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:44,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:44,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 67 times [2019-08-05 10:21:44,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:44,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-05 10:21:44,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:46,504 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 8 treesize of output 7 [2019-08-05 10:21:46,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:21:46,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:21:46,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:21:46,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:21:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:46,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:46,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:21:46,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:21:46,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:21:46,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=3785, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:21:46,560 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 72 states. [2019-08-05 10:21:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:49,432 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-08-05 10:21:49,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:21:49,432 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:21:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:49,433 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:21:49,433 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:21:49,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2895 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3243, Invalid=8099, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:21:49,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:21:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:21:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:21:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-08-05 10:21:49,436 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 72 [2019-08-05 10:21:49,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:49,436 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-08-05 10:21:49,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:21:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-08-05 10:21:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:21:49,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:49,437 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1] [2019-08-05 10:21:49,437 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:49,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:49,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1069725985, now seen corresponding path program 68 times [2019-08-05 10:21:49,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:49,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:21:49,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 595 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:50,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:21:50,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:21:50,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:21:50,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:21:50,062 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 38 states. [2019-08-05 10:21:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:50,749 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-08-05 10:21:50,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:21:50,750 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-08-05 10:21:50,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:50,751 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:21:50,751 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:21:50,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1998, Invalid=3258, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:21:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:21:50,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:21:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:21:50,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-05 10:21:50,756 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 73 [2019-08-05 10:21:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:50,756 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-05 10:21:50,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:21:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-05 10:21:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:21:50,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:50,757 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-08-05 10:21:50,757 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:50,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:50,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 69 times [2019-08-05 10:21:50,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:50,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 10:21:50,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:52,386 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 8 treesize of output 7 [2019-08-05 10:21:52,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:21:52,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:21:52,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:21:52,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:21:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:52,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:52,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:21:52,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:21:52,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:21:52,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1401, Invalid=4001, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:21:52,443 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 74 states. [2019-08-05 10:21:55,314 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 10:21:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:55,315 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2019-08-05 10:21:55,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:21:55,316 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:21:55,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:55,317 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:21:55,317 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:21:55,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3068 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3426, Invalid=8564, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:21:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:21:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:21:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:21:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-08-05 10:21:55,321 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-08-05 10:21:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:55,321 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-08-05 10:21:55,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:21:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-08-05 10:21:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:21:55,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:55,322 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2019-08-05 10:21:55,323 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:55,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:55,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 70 times [2019-08-05 10:21:55,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:55,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:21:55,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:56,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:56,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:21:56,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:21:56,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:21:56,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:21:56,420 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2019-08-05 10:21:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:57,118 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2019-08-05 10:21:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:21:57,119 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-08-05 10:21:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:57,120 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:21:57,120 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:21:57,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:21:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:21:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:21:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:21:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-08-05 10:21:57,123 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2019-08-05 10:21:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:57,123 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-08-05 10:21:57,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:21:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-08-05 10:21:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:21:57,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:57,124 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-08-05 10:21:57,124 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:57,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 71 times [2019-08-05 10:21:57,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:57,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:21:57,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:59,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-08-05 10:21:59,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:21:59,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:21:59,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:21:59,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:21:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:59,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:59,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:21:59,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:21:59,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:21:59,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1477, Invalid=4223, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:21:59,155 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 76 states. [2019-08-05 10:22:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:01,977 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2019-08-05 10:22:01,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:22:01,977 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:22:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:01,978 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:22:01,978 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:22:01,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3246 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3614, Invalid=9042, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:22:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:22:01,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:22:01,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:22:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-08-05 10:22:01,980 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 76 [2019-08-05 10:22:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:01,981 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-08-05 10:22:01,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:22:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-08-05 10:22:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:22:01,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:01,981 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1] [2019-08-05 10:22:01,982 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1766417601, now seen corresponding path program 72 times [2019-08-05 10:22:01,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:02,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:22:02,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 666 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:02,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:02,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:22:02,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:22:02,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:22:02,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:22:02,872 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 40 states. [2019-08-05 10:22:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:03,696 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-08-05 10:22:03,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:22:03,696 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2019-08-05 10:22:03,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:03,697 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:22:03,697 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:22:03,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:22:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:22:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:22:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:22:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-05 10:22:03,700 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2019-08-05 10:22:03,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:03,700 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-05 10:22:03,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:22:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-05 10:22:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:22:03,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:03,701 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-08-05 10:22:03,701 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:03,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 73 times [2019-08-05 10:22:03,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:03,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 163 conjunts are in the unsatisfiable core [2019-08-05 10:22:03,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:05,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 8 treesize of output 7 [2019-08-05 10:22:05,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:22:05,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:22:05,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:22:05,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:22:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:05,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:05,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:22:05,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:22:05,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:22:05,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1555, Invalid=4451, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:22:05,627 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 78 states. [2019-08-05 10:22:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:08,613 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-08-05 10:22:08,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:22:08,613 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:22:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:08,614 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:22:08,614 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:22:08,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3429 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3807, Invalid=9533, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:22:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:22:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:22:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:22:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-08-05 10:22:08,617 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-08-05 10:22:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:08,617 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-08-05 10:22:08,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:22:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-08-05 10:22:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:22:08,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:08,618 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2019-08-05 10:22:08,618 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 74 times [2019-08-05 10:22:08,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:08,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:22:08,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:09,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:09,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:22:09,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:22:09,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:22:09,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:22:09,231 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2019-08-05 10:22:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:09,977 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-08-05 10:22:09,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:22:09,978 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-08-05 10:22:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:09,979 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:22:09,979 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:22:09,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:22:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:22:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:22:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:22:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-05 10:22:09,982 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2019-08-05 10:22:09,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:09,982 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-05 10:22:09,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:22:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-05 10:22:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:22:09,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:09,983 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-08-05 10:22:09,983 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:09,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:09,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 75 times [2019-08-05 10:22:09,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:10,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-05 10:22:10,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:11,880 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 8 treesize of output 7 [2019-08-05 10:22:11,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:22:11,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:22:11,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:22:11,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:22:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:11,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:11,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:22:11,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:22:11,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:22:11,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1635, Invalid=4685, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:22:11,944 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 80 states. [2019-08-05 10:22:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:15,208 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2019-08-05 10:22:15,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:22:15,209 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:22:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:15,209 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:22:15,210 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:22:15,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3617 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4005, Invalid=10037, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:22:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:22:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:22:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:22:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-08-05 10:22:15,212 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2019-08-05 10:22:15,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:15,213 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-08-05 10:22:15,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:22:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-08-05 10:22:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:22:15,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:15,213 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1] [2019-08-05 10:22:15,214 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:15,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:15,214 INFO L82 PathProgramCache]: Analyzing trace with hash -787998623, now seen corresponding path program 76 times [2019-08-05 10:22:15,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:15,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:22:15,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 741 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:15,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:15,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:22:15,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:22:15,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:22:15,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:22:15,889 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 42 states. [2019-08-05 10:22:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:16,611 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-05 10:22:16,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:22:16,611 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2019-08-05 10:22:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:16,612 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:22:16,612 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:22:16,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:22:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:22:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:22:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:22:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-08-05 10:22:16,616 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 81 [2019-08-05 10:22:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:16,616 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-08-05 10:22:16,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:22:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-08-05 10:22:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:22:16,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:16,617 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-08-05 10:22:16,617 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:16,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:16,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 77 times [2019-08-05 10:22:16,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:16,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-05 10:22:16,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:18,994 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 8 treesize of output 7 [2019-08-05 10:22:18,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:22:19,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:22:19,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:22:19,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:22:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:19,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:19,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:22:19,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:22:19,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:22:19,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1717, Invalid=4925, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:22:19,071 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 82 states. [2019-08-05 10:22:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:22,114 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2019-08-05 10:22:22,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:22:22,114 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:22:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:22,115 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:22:22,115 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:22:22,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3810 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4208, Invalid=10554, Unknown=0, NotChecked=0, Total=14762 [2019-08-05 10:22:22,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:22:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:22:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:22:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-08-05 10:22:22,118 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-08-05 10:22:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:22,118 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-08-05 10:22:22,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:22:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-08-05 10:22:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:22:22,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:22,119 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2019-08-05 10:22:22,119 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 78 times [2019-08-05 10:22:22,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:22,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:22:22,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:22,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:22,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:22:22,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:22:22,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:22:22,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:22:22,914 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2019-08-05 10:22:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:23,930 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-08-05 10:22:23,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:22:23,931 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-08-05 10:22:23,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:23,932 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:22:23,932 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:22:23,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:22:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:22:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:22:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:22:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-05 10:22:23,935 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-08-05 10:22:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:23,935 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-05 10:22:23,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:22:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-05 10:22:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:22:23,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:23,936 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-08-05 10:22:23,937 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:23,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:23,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 79 times [2019-08-05 10:22:23,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:24,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 175 conjunts are in the unsatisfiable core [2019-08-05 10:22:24,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:26,205 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 8 treesize of output 7 [2019-08-05 10:22:26,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:22:26,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:22:26,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:22:26,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:22:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:26,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:26,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:22:26,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:22:26,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:22:26,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1801, Invalid=5171, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:22:26,284 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 84 states. [2019-08-05 10:22:29,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:29,614 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2019-08-05 10:22:29,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:22:29,614 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:22:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:29,615 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:22:29,615 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:22:29,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4008 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4416, Invalid=11084, Unknown=0, NotChecked=0, Total=15500 [2019-08-05 10:22:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:22:29,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:22:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:22:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-08-05 10:22:29,618 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 84 [2019-08-05 10:22:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:29,618 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-08-05 10:22:29,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:22:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-08-05 10:22:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:22:29,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:29,619 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1] [2019-08-05 10:22:29,619 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:29,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:29,619 INFO L82 PathProgramCache]: Analyzing trace with hash 962909185, now seen corresponding path program 80 times [2019-08-05 10:22:29,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:29,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:22:29,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 820 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:30,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:30,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:22:30,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:22:30,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:22:30,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:22:30,289 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 44 states. [2019-08-05 10:22:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:31,130 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-08-05 10:22:31,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:22:31,131 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2019-08-05 10:22:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:31,132 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:22:31,132 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:22:31,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2709, Invalid=4431, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:22:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:22:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:22:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:22:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-05 10:22:31,134 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 85 [2019-08-05 10:22:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:31,135 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-05 10:22:31,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:22:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-05 10:22:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:22:31,136 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:31,136 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-08-05 10:22:31,136 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:31,136 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 81 times [2019-08-05 10:22:31,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:31,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 179 conjunts are in the unsatisfiable core [2019-08-05 10:22:31,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:33,304 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 8 treesize of output 7 [2019-08-05 10:22:33,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:22:33,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:22:33,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:22:33,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:22:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:33,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:33,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:22:33,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:22:33,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:22:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1887, Invalid=5423, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:22:33,373 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 86 states. [2019-08-05 10:22:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:37,081 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2019-08-05 10:22:37,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:22:37,081 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:22:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:37,082 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:22:37,082 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:22:37,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4211 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4629, Invalid=11627, Unknown=0, NotChecked=0, Total=16256 [2019-08-05 10:22:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:22:37,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:22:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:22:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-08-05 10:22:37,084 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-08-05 10:22:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:37,085 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-08-05 10:22:37,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:22:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-08-05 10:22:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:22:37,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:37,085 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2019-08-05 10:22:37,086 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:37,086 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 82 times [2019-08-05 10:22:37,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:37,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:22:37,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:37,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:37,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:22:37,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:22:37,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:22:37,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:22:37,806 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2019-08-05 10:22:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:38,809 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-08-05 10:22:38,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:22:38,809 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-08-05 10:22:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:38,810 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:22:38,810 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:22:38,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:22:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:22:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:22:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:22:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-08-05 10:22:38,812 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2019-08-05 10:22:38,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:38,812 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-08-05 10:22:38,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:22:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-08-05 10:22:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:22:38,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:38,813 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-08-05 10:22:38,813 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:38,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:38,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 83 times [2019-08-05 10:22:38,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:38,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-05 10:22:38,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:41,200 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 8 treesize of output 7 [2019-08-05 10:22:41,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:22:41,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:22:41,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:22:41,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:22:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:41,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:41,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:22:41,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:22:41,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:22:41,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1975, Invalid=5681, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:22:41,268 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 88 states. [2019-08-05 10:22:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:44,996 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2019-08-05 10:22:44,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:22:44,996 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:22:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:44,997 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:22:44,997 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:22:44,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4419 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4847, Invalid=12183, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:22:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:22:44,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:22:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:22:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-08-05 10:22:44,999 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 88 [2019-08-05 10:22:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:45,000 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-08-05 10:22:45,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:22:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-08-05 10:22:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:22:45,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:45,001 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1] [2019-08-05 10:22:45,001 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:45,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash -12216415, now seen corresponding path program 84 times [2019-08-05 10:22:45,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:45,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:22:45,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 903 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:45,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:45,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:22:45,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:22:45,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:22:45,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:22:45,753 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 46 states. [2019-08-05 10:22:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:46,615 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-08-05 10:22:46,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:22:46,615 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2019-08-05 10:22:46,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:46,616 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:22:46,616 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:22:46,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2970, Invalid=4862, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:22:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:22:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:22:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:22:46,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-05 10:22:46,619 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2019-08-05 10:22:46,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:46,620 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-05 10:22:46,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:22:46,620 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-05 10:22:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:22:46,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:46,620 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-08-05 10:22:46,621 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:46,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:46,621 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 85 times [2019-08-05 10:22:46,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:46,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 187 conjunts are in the unsatisfiable core [2019-08-05 10:22:46,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:49,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-08-05 10:22:49,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:22:49,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:22:49,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:22:49,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:22:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:49,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:49,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:22:49,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:22:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:22:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2065, Invalid=5945, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:22:49,342 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 90 states. [2019-08-05 10:22:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:53,020 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2019-08-05 10:22:53,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:22:53,021 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:22:53,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:53,021 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:22:53,022 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:22:53,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4632 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5070, Invalid=12752, Unknown=0, NotChecked=0, Total=17822 [2019-08-05 10:22:53,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:22:53,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:22:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:22:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-08-05 10:22:53,024 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-08-05 10:22:53,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:53,024 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-08-05 10:22:53,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:22:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-08-05 10:22:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:22:53,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:53,025 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2019-08-05 10:22:53,025 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:53,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 86 times [2019-08-05 10:22:53,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:53,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:22:53,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:53,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:53,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:22:53,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:22:53,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:22:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:22:53,960 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2019-08-05 10:22:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:55,082 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-08-05 10:22:55,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:22:55,083 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-08-05 10:22:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:55,084 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:22:55,084 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:22:55,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:22:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:22:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:22:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:22:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-05 10:22:55,087 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2019-08-05 10:22:55,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:55,087 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-05 10:22:55,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:22:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-05 10:22:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:22:55,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:55,088 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-08-05 10:22:55,088 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:55,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:55,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 87 times [2019-08-05 10:22:55,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:55,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 191 conjunts are in the unsatisfiable core [2019-08-05 10:22:55,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:57,605 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 8 treesize of output 7 [2019-08-05 10:22:57,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:22:57,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:22:57,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:22:57,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:22:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:57,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:57,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:22:57,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:22:57,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:22:57,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2157, Invalid=6215, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:22:57,678 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 92 states. [2019-08-05 10:23:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:01,817 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2019-08-05 10:23:01,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:23:01,817 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:23:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:01,818 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:23:01,818 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:23:01,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4850 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5298, Invalid=13334, Unknown=0, NotChecked=0, Total=18632 [2019-08-05 10:23:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:23:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:23:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:23:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-08-05 10:23:01,821 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2019-08-05 10:23:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:01,821 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-08-05 10:23:01,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:23:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-08-05 10:23:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:23:01,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:01,822 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1] [2019-08-05 10:23:01,822 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:01,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:01,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2047894337, now seen corresponding path program 88 times [2019-08-05 10:23:01,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:01,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:23:01,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 990 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:02,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:02,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:23:02,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:23:02,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:23:02,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:23:02,885 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 48 states. [2019-08-05 10:23:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:03,797 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-08-05 10:23:03,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:23:03,797 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-08-05 10:23:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:03,798 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:23:03,798 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:23:03,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:23:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:23:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:23:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:23:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-08-05 10:23:03,801 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 93 [2019-08-05 10:23:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:03,802 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-08-05 10:23:03,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:23:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-08-05 10:23:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:23:03,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:03,802 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-08-05 10:23:03,803 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:03,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:03,803 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 89 times [2019-08-05 10:23:03,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:03,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-05 10:23:03,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:06,628 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 8 treesize of output 7 [2019-08-05 10:23:06,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:23:06,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:23:06,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:23:06,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:23:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:06,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:06,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:23:06,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:23:06,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:23:06,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2251, Invalid=6491, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:23:06,703 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 94 states. [2019-08-05 10:23:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:10,970 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2019-08-05 10:23:10,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:23:10,970 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:23:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:10,971 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:23:10,971 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:23:10,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5073 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5531, Invalid=13929, Unknown=0, NotChecked=0, Total=19460 [2019-08-05 10:23:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:23:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:23:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:23:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-08-05 10:23:10,974 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-08-05 10:23:10,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:10,974 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-08-05 10:23:10,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:23:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-08-05 10:23:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:23:10,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:10,975 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2019-08-05 10:23:10,975 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:10,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 90 times [2019-08-05 10:23:10,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:11,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:23:11,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:11,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:11,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:23:11,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:23:11,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:23:11,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:23:11,826 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2019-08-05 10:23:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:12,799 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-08-05 10:23:12,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:23:12,799 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-08-05 10:23:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:12,800 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:23:12,800 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:23:12,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:23:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:23:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:23:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:23:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-05 10:23:12,803 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-08-05 10:23:12,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:12,803 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-05 10:23:12,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:23:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-05 10:23:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:23:12,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:12,804 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-08-05 10:23:12,804 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:12,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:12,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 91 times [2019-08-05 10:23:12,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:12,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 199 conjunts are in the unsatisfiable core [2019-08-05 10:23:12,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:15,651 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 8 treesize of output 7 [2019-08-05 10:23:15,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:23:15,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:23:15,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:23:15,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:23:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:15,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:15,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:23:15,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:23:15,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:23:15,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2347, Invalid=6773, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:23:15,727 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 96 states. [2019-08-05 10:23:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:19,992 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2019-08-05 10:23:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:23:19,993 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:23:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:19,993 INFO L225 Difference]: With dead ends: 145 [2019-08-05 10:23:19,994 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:23:19,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5301 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5769, Invalid=14537, Unknown=0, NotChecked=0, Total=20306 [2019-08-05 10:23:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:23:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:23:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:23:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-08-05 10:23:19,995 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 96 [2019-08-05 10:23:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:19,996 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-08-05 10:23:19,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:23:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-08-05 10:23:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:23:19,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:19,996 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1] [2019-08-05 10:23:19,996 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:19,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1537947361, now seen corresponding path program 92 times [2019-08-05 10:23:19,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:20,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:23:20,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1081 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:20,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:20,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:23:20,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:23:20,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:23:20,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:23:20,910 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 50 states. [2019-08-05 10:23:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:21,910 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-08-05 10:23:21,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:23:21,915 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2019-08-05 10:23:21,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:21,916 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:23:21,916 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:23:21,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2162 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3528, Invalid=5784, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:23:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:23:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:23:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:23:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-05 10:23:21,918 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 97 [2019-08-05 10:23:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:21,918 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-05 10:23:21,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:23:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-05 10:23:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:23:21,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:21,919 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-08-05 10:23:21,919 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:21,919 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 93 times [2019-08-05 10:23:21,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:21,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 202 conjunts are in the unsatisfiable core [2019-08-05 10:23:21,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:24,706 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 8 treesize of output 7 [2019-08-05 10:23:24,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:23:24,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:23:24,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:23:24,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:23:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:24,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:24,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:23:24,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:23:24,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:23:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2448, Invalid=7058, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:23:24,802 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 98 states. [2019-08-05 10:23:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:29,253 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2019-08-05 10:23:29,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:23:29,254 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:23:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:29,255 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:23:29,255 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:23:29,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5587 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6021, Invalid=15149, Unknown=0, NotChecked=0, Total=21170 [2019-08-05 10:23:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:23:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:23:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:23:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-08-05 10:23:29,258 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-08-05 10:23:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:29,270 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-08-05 10:23:29,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:23:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-08-05 10:23:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:23:29,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:29,271 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2019-08-05 10:23:29,271 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:29,272 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 94 times [2019-08-05 10:23:29,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:29,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:23:29,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:30,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:30,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:23:30,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:23:30,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:23:30,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:23:30,437 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2019-08-05 10:23:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:31,493 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-08-05 10:23:31,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:23:31,493 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-08-05 10:23:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:31,494 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:23:31,494 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:23:31,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:23:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:23:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:23:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:23:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-08-05 10:23:31,498 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2019-08-05 10:23:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:31,498 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-08-05 10:23:31,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:23:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-08-05 10:23:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:23:31,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:31,499 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-08-05 10:23:31,499 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:31,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 95 times [2019-08-05 10:23:31,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:31,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-05 10:23:31,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:34,339 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 8 treesize of output 7 [2019-08-05 10:23:34,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:23:34,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:23:34,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:23:34,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:23:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:34,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:34,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:23:34,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:23:34,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:23:34,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2545, Invalid=7355, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:23:34,414 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 100 states. [2019-08-05 10:23:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:38,999 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2019-08-05 10:23:38,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:23:38,999 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:23:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:39,000 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:23:39,000 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:23:39,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5772 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6260, Invalid=15792, Unknown=0, NotChecked=0, Total=22052 [2019-08-05 10:23:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:23:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:23:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:23:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-08-05 10:23:39,003 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 100 [2019-08-05 10:23:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:39,004 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-08-05 10:23:39,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:23:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-08-05 10:23:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:23:39,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:39,004 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1] [2019-08-05 10:23:39,004 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash 276566657, now seen corresponding path program 96 times [2019-08-05 10:23:39,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:39,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:23:39,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1176 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:40,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:40,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:23:40,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:23:40,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:23:40,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:23:40,031 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 52 states. [2019-08-05 10:23:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:41,286 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-05 10:23:41,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:23:41,287 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2019-08-05 10:23:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:41,288 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:23:41,288 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:23:41,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3825, Invalid=6275, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:23:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:23:41,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:23:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:23:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-05 10:23:41,291 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2019-08-05 10:23:41,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:41,292 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-05 10:23:41,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:23:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-05 10:23:41,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:23:41,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:41,293 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-08-05 10:23:41,293 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:41,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:41,293 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 97 times [2019-08-05 10:23:41,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:41,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 211 conjunts are in the unsatisfiable core [2019-08-05 10:23:41,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:44,318 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 8 treesize of output 7 [2019-08-05 10:23:44,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:23:44,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:23:44,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:23:44,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:23:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:44,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:44,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:23:44,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:23:44,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:23:44,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2647, Invalid=7655, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:23:44,412 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 102 states. [2019-08-05 10:23:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:49,720 INFO L93 Difference]: Finished difference Result 154 states and 156 transitions. [2019-08-05 10:23:49,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:23:49,720 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:23:49,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:49,721 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:23:49,721 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:23:49,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6015 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=6513, Invalid=16439, Unknown=0, NotChecked=0, Total=22952 [2019-08-05 10:23:49,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:23:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:23:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:23:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-08-05 10:23:49,724 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2019-08-05 10:23:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:49,724 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-08-05 10:23:49,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:23:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-08-05 10:23:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:23:49,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:49,725 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2019-08-05 10:23:49,725 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:49,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 98 times [2019-08-05 10:23:49,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:49,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:23:49,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:51,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:51,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:23:51,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:23:51,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:23:51,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:23:51,028 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2019-08-05 10:23:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:52,156 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2019-08-05 10:23:52,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:23:52,156 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-08-05 10:23:52,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:52,157 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:23:52,157 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:23:52,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:23:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:23:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:23:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:23:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-05 10:23:52,161 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2019-08-05 10:23:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:52,161 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-05 10:23:52,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:23:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-05 10:23:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:23:52,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:52,162 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-08-05 10:23:52,163 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:52,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:52,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 99 times [2019-08-05 10:23:52,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:52,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 215 conjunts are in the unsatisfiable core [2019-08-05 10:23:52,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:55,331 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 8 treesize of output 7 [2019-08-05 10:23:55,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:23:55,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:23:55,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:23:55,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:23:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:55,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:55,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:23:55,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:23:55,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:23:55,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2751, Invalid=7961, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:23:55,420 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 104 states. [2019-08-05 10:24:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:00,426 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2019-08-05 10:24:00,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:24:00,426 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 10:24:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:00,427 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:24:00,427 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:24:00,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6263 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=6771, Invalid=17099, Unknown=0, NotChecked=0, Total=23870 [2019-08-05 10:24:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:24:00,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:24:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:24:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-08-05 10:24:00,431 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2019-08-05 10:24:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:00,431 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-08-05 10:24:00,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:24:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-08-05 10:24:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:24:00,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:00,432 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1] [2019-08-05 10:24:00,432 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:00,433 INFO L82 PathProgramCache]: Analyzing trace with hash 526972449, now seen corresponding path program 100 times [2019-08-05 10:24:00,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:00,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:24:00,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:01,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1275 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:01,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:01,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:24:01,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:24:01,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:24:01,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:24:01,985 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 54 states. [2019-08-05 10:24:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:03,175 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-08-05 10:24:03,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:24:03,176 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2019-08-05 10:24:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:03,177 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:24:03,177 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:24:03,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:24:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:24:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:24:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:24:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-08-05 10:24:03,180 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 105 [2019-08-05 10:24:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:03,181 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-08-05 10:24:03,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:24:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-08-05 10:24:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:24:03,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:03,181 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-08-05 10:24:03,182 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 101 times [2019-08-05 10:24:03,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:03,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-05 10:24:03,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:06,647 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 8 treesize of output 7 [2019-08-05 10:24:06,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:24:06,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:24:06,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:24:06,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 10:24:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:06,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:06,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:24:06,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:24:06,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:24:06,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2857, Invalid=8273, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:24:06,730 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 106 states. Received shutdown request... [2019-08-05 10:24:10,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:24:10,198 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:24:10,205 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:24:10,205 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:24:10 BoogieIcfgContainer [2019-08-05 10:24:10,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:24:10,206 INFO L168 Benchmark]: Toolchain (without parser) took 241378.70 ms. Allocated memory was 133.7 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 108.6 MB in the beginning and 627.7 MB in the end (delta: -519.1 MB). Peak memory consumption was 571.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:24:10,207 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory was 110.1 MB in the beginning and 109.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:24:10,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.35 ms. Allocated memory is still 133.7 MB. Free memory was 108.6 MB in the beginning and 106.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:24:10,208 INFO L168 Benchmark]: Boogie Preprocessor took 21.69 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 105.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:24:10,208 INFO L168 Benchmark]: RCFGBuilder took 363.72 ms. Allocated memory is still 133.7 MB. Free memory was 105.6 MB in the beginning and 95.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:24:10,208 INFO L168 Benchmark]: TraceAbstraction took 240955.82 ms. Allocated memory was 133.7 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 94.9 MB in the beginning and 627.7 MB in the end (delta: -532.8 MB). Peak memory consumption was 557.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:24:10,210 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.22 ms. Allocated memory is still 133.7 MB. Free memory was 110.1 MB in the beginning and 109.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.35 ms. Allocated memory is still 133.7 MB. Free memory was 108.6 MB in the beginning and 106.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.69 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 105.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.72 ms. Allocated memory is still 133.7 MB. Free memory was 105.6 MB in the beginning and 95.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240955.82 ms. Allocated memory was 133.7 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 94.9 MB in the beginning and 627.7 MB in the end (delta: -532.8 MB). Peak memory consumption was 557.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 80). Cancelled while BasicCegarLoop was constructing difference of abstraction (107states) and FLOYD_HOARE automaton (currently 75 states, 106 states before enhancement),while ReachableStatesComputation was computing reachable states (93 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 240.8s OverallTime, 103 OverallIterations, 51 TraceHistogramMax, 131.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 256 SDtfs, 348 SDslu, 1470 SDs, 0 SdLazy, 57946 SolverSat, 5781 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8263 GetRequests, 1429 SyntacticMatches, 0 SemanticMatches, 6834 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158086 ImplicationChecksByTransitivity, 177.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=102, 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.2s AutomataMinimizationTime, 102 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 104.8s InterpolantComputationTime, 5665 NumberOfCodeBlocks, 5665 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 5562 ConstructedInterpolants, 0 QuantifiedInterpolants, 2060373 SizeOfPredicates, 410 NumberOfNonLiveVariables, 34299 ConjunctsInSsa, 8818 ConjunctsInUnsatCore, 103 InterpolantComputations, 1 PerfectInterpolantSequences, 22100/92378 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown