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/20181010-MemSafetyPathprograms/960521-1_1_true-valid-memsafety.i_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:03:13,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:03:13,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:03:13,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:03:13,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:03:13,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:03:13,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:03:13,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:03:13,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:03:13,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:03:13,817 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:03:13,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:03:13,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:03:13,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:03:13,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:03:13,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:03:13,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:03:13,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:03:13,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:03:13,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:03:13,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:03:13,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:03:13,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:03:13,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:03:13,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:03:13,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:03:13,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:03:13,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:03:13,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:03:13,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:03:13,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:03:13,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:03:13,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:03:13,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:03:13,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:03:13,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:03:13,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:03:13,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:03:13,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:03:13,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:03:13,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:03:13,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:03:13,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:03:13,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:03:13,899 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:03:13,899 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:03:13,900 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_1_true-valid-memsafety.i_11.bpl [2019-08-05 11:03:13,901 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_1_true-valid-memsafety.i_11.bpl' [2019-08-05 11:03:13,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:03:13,949 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:03:13,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:03:13,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:03:13,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:03:13,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:13" (1/1) ... [2019-08-05 11:03:13,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:13" (1/1) ... [2019-08-05 11:03:13,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:03:13,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:03:13,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:03:13,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:03:13,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:13" (1/1) ... [2019-08-05 11:03:14,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:13" (1/1) ... [2019-08-05 11:03:14,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:13" (1/1) ... [2019-08-05 11:03:14,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:13" (1/1) ... [2019-08-05 11:03:14,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:13" (1/1) ... [2019-08-05 11:03:14,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:13" (1/1) ... [2019-08-05 11:03:14,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:13" (1/1) ... [2019-08-05 11:03:14,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:03:14,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:03:14,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:03:14,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:03:14,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:03:14,100 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:03:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:03:14,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:03:14,458 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:03:14,459 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:03:14,461 INFO L202 PluginConnector]: Adding new model 960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:03:14 BoogieIcfgContainer [2019-08-05 11:03:14,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:03:14,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:03:14,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:03:14,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:03:14,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:13" (1/2) ... [2019-08-05 11:03:14,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e7e6e7 and model type 960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:03:14, skipping insertion in model container [2019-08-05 11:03:14,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:03:14" (2/2) ... [2019-08-05 11:03:14,470 INFO L109 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i_11.bpl [2019-08-05 11:03:14,482 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:03:14,490 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:03:14,517 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:03:14,546 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:03:14,547 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:03:14,547 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:03:14,548 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:03:14,548 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:03:14,548 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:03:14,548 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:03:14,548 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:03:14,548 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:03:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:03:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:03:14,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:14,579 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:03:14,582 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2019-08-05 11:03:14,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:14,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:03:14,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:14,930 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:03:14,931 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:14,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:14,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:14,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:14,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:03:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:15,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:03:15,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:03:15,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:03:15,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:03:15,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:03:15,116 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 5 states. [2019-08-05 11:03:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:15,508 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-05 11:03:15,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:03:15,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:03:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:15,521 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:03:15,521 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:03:15,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:03:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:03:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-08-05 11:03:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:03:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 11:03:15,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2019-08-05 11:03:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:15,562 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 11:03:15,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:03:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 11:03:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:03:15,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:15,563 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:03:15,564 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:15,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:15,564 INFO L82 PathProgramCache]: Analyzing trace with hash 149049733, now seen corresponding path program 1 times [2019-08-05 11:03:15,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:15,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:03:15,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:15,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:03:15,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:03:15,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:03:15,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:03:15,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:03:15,719 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 5 states. [2019-08-05 11:03:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:15,751 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 11:03:15,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:03:15,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 11:03:15,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:15,752 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:03:15,752 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:03:15,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:03:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:03:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:03:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:03:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:03:15,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2019-08-05 11:03:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:15,756 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:03:15,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:03:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:03:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:03:15,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:15,758 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:03:15,758 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:15,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:15,759 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2019-08-05 11:03:15,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:15,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:03:15,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:15,877 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_7|], 1=[|v_#valid_8|]} [2019-08-05 11:03:15,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:15,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:15,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:15,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:15,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:15,934 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:16,078 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:03:16,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:16,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:16,080 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:16,183 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 11:03:16,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:16,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:03:16,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:03:16,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:03:16,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:03:16,185 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2019-08-05 11:03:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:16,352 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-08-05 11:03:16,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:03:16,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 11:03:16,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:16,358 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:03:16,358 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:03:16,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:03:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:03:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2019-08-05 11:03:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:03:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:03:16,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2019-08-05 11:03:16,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:16,363 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:03:16,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:03:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:03:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:03:16,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:16,364 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:03:16,364 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:16,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:16,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2019-08-05 11:03:16,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:16,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:03:16,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:16,483 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_8|], 1=[|v_#valid_9|]} [2019-08-05 11:03:16,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:16,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:16,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:16,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:16,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:16,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:16,715 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:03:16,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:16,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:16,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:16,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:16,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:03:16,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:03:16,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:03:16,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:03:16,937 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 7 states. [2019-08-05 11:03:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:17,265 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-08-05 11:03:17,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:03:17,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 11:03:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:17,267 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:03:17,267 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:03:17,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:03:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:03:17,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-08-05 11:03:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:03:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 11:03:17,274 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-08-05 11:03:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:17,275 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 11:03:17,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:03:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 11:03:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:03:17,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:17,276 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:17,276 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:17,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:17,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1946764223, now seen corresponding path program 2 times [2019-08-05 11:03:17,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:17,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:03:17,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:17,375 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_9|], 1=[|v_#valid_10|]} [2019-08-05 11:03:17,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:17,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:17,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:17,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:17,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:17,430 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:17,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:17,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:17,443 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:17,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:17,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:03:17,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:03:17,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:03:17,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:03:17,552 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 7 states. [2019-08-05 11:03:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:17,708 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-08-05 11:03:17,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:03:17,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 11:03:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:17,710 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:03:17,710 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:03:17,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:03:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:03:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2019-08-05 11:03:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:03:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-08-05 11:03:17,714 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2019-08-05 11:03:17,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:17,714 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-08-05 11:03:17,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:03:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-08-05 11:03:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:03:17,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:17,715 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:17,715 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:17,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:17,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2135429881, now seen corresponding path program 2 times [2019-08-05 11:03:17,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:17,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:03:17,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:17,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:17,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:03:17,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:03:17,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:03:17,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:03:17,851 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 7 states. [2019-08-05 11:03:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:17,905 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-08-05 11:03:17,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:03:17,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 11:03:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:17,907 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:03:17,907 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:03:17,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:03:17,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:03:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:03:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:03:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 11:03:17,911 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-08-05 11:03:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:17,911 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 11:03:17,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:03:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 11:03:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:03:17,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:17,912 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:17,912 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:17,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1765270407, now seen corresponding path program 3 times [2019-08-05 11:03:17,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:17,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:03:17,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:18,115 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_10|], 1=[|v_#valid_11|]} [2019-08-05 11:03:18,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:18,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:18,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:18,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:18,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:18,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:18,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:18,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:18,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:18,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:18,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:03:18,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:03:18,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:03:18,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:03:18,288 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 8 states. [2019-08-05 11:03:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:18,555 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-08-05 11:03:18,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:03:18,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 11:03:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:18,557 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:03:18,557 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:03:18,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:03:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:03:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-08-05 11:03:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:03:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-08-05 11:03:18,561 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-08-05 11:03:18,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:18,562 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-08-05 11:03:18,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:03:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-08-05 11:03:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:03:18,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:18,563 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-08-05 11:03:18,563 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:18,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:18,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1715698183, now seen corresponding path program 3 times [2019-08-05 11:03:18,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:18,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:03:18,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:18,726 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_11|], 1=[|v_#valid_12|]} [2019-08-05 11:03:18,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:18,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:18,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:18,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:18,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:18,762 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:18,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:18,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:18,780 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:18,816 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 11:03:18,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:18,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:03:18,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:03:18,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:03:18,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:03:18,818 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 8 states. [2019-08-05 11:03:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:18,986 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-08-05 11:03:18,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:03:18,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 11:03:18,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:18,990 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:03:18,990 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:03:18,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:03:18,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:03:18,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2019-08-05 11:03:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:03:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-08-05 11:03:18,994 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2019-08-05 11:03:18,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:18,995 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-08-05 11:03:18,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:03:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-08-05 11:03:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:03:18,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:18,996 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 11:03:18,996 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:18,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:18,997 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 4 times [2019-08-05 11:03:18,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:19,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:03:19,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:19,164 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_12|], 1=[|v_#valid_13|]} [2019-08-05 11:03:19,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:19,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:19,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:19,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:19,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:19,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:19,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:19,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:19,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:19,572 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 11:03:19,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:19,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:03:19,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:03:19,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:03:19,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:03:19,574 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 10 states. [2019-08-05 11:03:19,882 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-08-05 11:03:20,232 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-08-05 11:03:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:20,379 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-08-05 11:03:20,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:03:20,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 11:03:20,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:20,380 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:03:20,380 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:03:20,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:20,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:03:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-08-05 11:03:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:03:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-08-05 11:03:20,386 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2019-08-05 11:03:20,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:20,386 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-08-05 11:03:20,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:03:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-08-05 11:03:20,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:03:20,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:20,387 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:20,387 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:20,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:20,388 INFO L82 PathProgramCache]: Analyzing trace with hash 481540147, now seen corresponding path program 5 times [2019-08-05 11:03:20,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:20,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:03:20,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:20,533 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_13|], 1=[|v_#valid_14|]} [2019-08-05 11:03:20,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:20,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:20,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:20,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:20,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:20,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:20,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:20,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:20,580 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:20,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:20,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:03:20,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:03:20,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:03:20,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:03:20,654 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 9 states. [2019-08-05 11:03:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:20,871 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-08-05 11:03:20,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:03:20,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-08-05 11:03:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:20,872 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:03:20,872 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:03:20,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:03:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2019-08-05 11:03:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:03:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-08-05 11:03:20,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2019-08-05 11:03:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:20,877 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-08-05 11:03:20,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:03:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-08-05 11:03:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:03:20,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:20,878 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2019-08-05 11:03:20,879 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:20,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:20,879 INFO L82 PathProgramCache]: Analyzing trace with hash 531112371, now seen corresponding path program 4 times [2019-08-05 11:03:20,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:20,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:03:20,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:21,020 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_14|], 1=[|v_#valid_15|]} [2019-08-05 11:03:21,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:21,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:21,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:21,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:21,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:21,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:21,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:21,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:21,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:21,115 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 11:03:21,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:21,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:03:21,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:03:21,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:03:21,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:03:21,116 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 9 states. [2019-08-05 11:03:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:21,300 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-08-05 11:03:21,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:03:21,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-08-05 11:03:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:21,307 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:03:21,308 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:03:21,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:03:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:03:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. [2019-08-05 11:03:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:03:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-08-05 11:03:21,312 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2019-08-05 11:03:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:21,312 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-08-05 11:03:21,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:03:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-08-05 11:03:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:03:21,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:21,313 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2019-08-05 11:03:21,314 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2029806995, now seen corresponding path program 6 times [2019-08-05 11:03:21,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:21,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:03:21,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:21,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:21,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:03:21,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:03:21,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:03:21,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:03:21,581 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 9 states. [2019-08-05 11:03:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:21,630 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-08-05 11:03:21,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:03:21,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-08-05 11:03:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:21,632 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:03:21,632 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:03:21,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:03:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:03:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:03:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:03:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-08-05 11:03:21,636 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2019-08-05 11:03:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:21,636 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-08-05 11:03:21,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:03:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-08-05 11:03:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:03:21,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:21,637 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2019-08-05 11:03:21,637 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:21,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:21,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1096334355, now seen corresponding path program 7 times [2019-08-05 11:03:21,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:21,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:03:21,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:21,725 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_15|], 1=[|v_#valid_16|]} [2019-08-05 11:03:21,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:21,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:21,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:21,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:21,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:21,746 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:21,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:21,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:21,758 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:22,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:22,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:03:22,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:03:22,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:03:22,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:03:22,098 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 11 states. [2019-08-05 11:03:22,559 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-08-05 11:03:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:22,610 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-08-05 11:03:22,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:03:22,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-05 11:03:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:22,611 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:03:22,611 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:03:22,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:03:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:03:22,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2019-08-05 11:03:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:03:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-08-05 11:03:22,616 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2019-08-05 11:03:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:22,616 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-08-05 11:03:22,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:03:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-08-05 11:03:22,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:03:22,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:22,617 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:22,617 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:22,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:22,618 INFO L82 PathProgramCache]: Analyzing trace with hash -702067347, now seen corresponding path program 8 times [2019-08-05 11:03:22,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:22,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:03:22,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:22,778 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_16|], 1=[|v_#valid_17|]} [2019-08-05 11:03:22,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:22,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:22,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:22,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:22,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:22,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:22,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:22,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:22,891 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:22,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:22,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:03:22,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:03:22,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:03:22,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:03:22,943 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 10 states. [2019-08-05 11:03:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:23,167 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-08-05 11:03:23,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:03:23,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 11:03:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:23,169 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:03:23,169 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:03:23,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:03:23,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:03:23,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-08-05 11:03:23,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:03:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-08-05 11:03:23,173 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2019-08-05 11:03:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:23,174 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-08-05 11:03:23,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:03:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-08-05 11:03:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:03:23,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:23,175 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2019-08-05 11:03:23,175 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:23,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:23,175 INFO L82 PathProgramCache]: Analyzing trace with hash -652495123, now seen corresponding path program 5 times [2019-08-05 11:03:23,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:23,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:03:23,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:23,292 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_17|], 1=[|v_#valid_18|]} [2019-08-05 11:03:23,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:23,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:23,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:23,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:23,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:23,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:23,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:23,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:23,319 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:23,365 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 11:03:23,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:23,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:03:23,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:03:23,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:03:23,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:03:23,366 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 10 states. [2019-08-05 11:03:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:23,570 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-08-05 11:03:23,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:03:23,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 11:03:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:23,572 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:03:23,572 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:03:23,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:03:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:03:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2019-08-05 11:03:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:03:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-08-05 11:03:23,577 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2019-08-05 11:03:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:23,577 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-08-05 11:03:23,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:03:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-08-05 11:03:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:03:23,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:23,578 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2019-08-05 11:03:23,578 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:23,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:23,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 9 times [2019-08-05 11:03:23,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:23,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:03:23,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:23,660 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_18|], 1=[|v_#valid_19|]} [2019-08-05 11:03:23,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:23,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:23,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:23,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:23,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:23,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:23,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:23,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:23,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:23,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:23,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:03:23,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:03:23,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:03:23,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:03:23,915 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 12 states. [2019-08-05 11:03:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:24,388 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-08-05 11:03:24,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:03:24,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 11:03:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:24,390 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:03:24,390 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:03:24,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:03:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:03:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-08-05 11:03:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:03:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-08-05 11:03:24,396 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2019-08-05 11:03:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:24,397 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-08-05 11:03:24,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:03:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-08-05 11:03:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:03:24,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:24,398 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1] [2019-08-05 11:03:24,399 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash -376802649, now seen corresponding path program 10 times [2019-08-05 11:03:24,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:24,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:03:24,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:24,486 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_19|], 1=[|v_#valid_20|]} [2019-08-05 11:03:24,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:24,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:24,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:24,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:24,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:24,505 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:24,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:24,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:24,514 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:24,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:24,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:03:24,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:03:24,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:03:24,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:03:24,633 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 12 states. [2019-08-05 11:03:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:25,009 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-08-05 11:03:25,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:03:25,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 11:03:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:25,011 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:03:25,011 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:03:25,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:03:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-08-05 11:03:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:03:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-08-05 11:03:25,016 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2019-08-05 11:03:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:25,017 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-08-05 11:03:25,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:03:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-08-05 11:03:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:03:25,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:25,018 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:25,018 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:25,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:25,018 INFO L82 PathProgramCache]: Analyzing trace with hash 17464359, now seen corresponding path program 11 times [2019-08-05 11:03:25,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:25,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:03:25,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:25,665 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_20|], 1=[|v_#valid_21|]} [2019-08-05 11:03:25,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:25,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:25,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:25,860 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:03:25,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:25,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:25,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:26,048 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:03:26,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:26,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:26,050 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:26,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:26,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:03:26,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:03:26,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:03:26,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:03:26,201 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 11 states. [2019-08-05 11:03:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:26,461 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-08-05 11:03:26,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:03:26,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-08-05 11:03:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:26,464 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:03:26,464 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:03:26,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:26,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:03:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 27. [2019-08-05 11:03:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:03:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-08-05 11:03:26,469 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2019-08-05 11:03:26,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:26,469 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-08-05 11:03:26,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:03:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-08-05 11:03:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:03:26,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:26,470 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2019-08-05 11:03:26,470 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:26,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:26,470 INFO L82 PathProgramCache]: Analyzing trace with hash 67036583, now seen corresponding path program 6 times [2019-08-05 11:03:26,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:26,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:03:26,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:26,600 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_21|], 1=[|v_#valid_22|]} [2019-08-05 11:03:26,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:26,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:26,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:26,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:26,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:26,637 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:26,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:26,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:26,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:26,705 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 11:03:26,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:26,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:03:26,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:03:26,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:03:26,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:03:26,707 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 11 states. [2019-08-05 11:03:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:26,928 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-08-05 11:03:26,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:03:26,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-08-05 11:03:26,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:26,930 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:03:26,931 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:03:26,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:03:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 29. [2019-08-05 11:03:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:03:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-08-05 11:03:26,934 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2019-08-05 11:03:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:26,934 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-08-05 11:03:26,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:03:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-08-05 11:03:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:03:26,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:26,935 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2019-08-05 11:03:26,935 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:26,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:26,936 INFO L82 PathProgramCache]: Analyzing trace with hash -749082655, now seen corresponding path program 12 times [2019-08-05 11:03:26,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:26,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:03:26,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:27,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:27,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:03:27,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:03:27,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:03:27,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:03:27,062 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 11 states. [2019-08-05 11:03:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:27,139 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-08-05 11:03:27,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:03:27,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-05 11:03:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:27,140 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:03:27,140 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:03:27,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:03:27,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:03:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:03:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:03:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-08-05 11:03:27,143 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2019-08-05 11:03:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:27,143 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-08-05 11:03:27,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:03:27,144 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-08-05 11:03:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:03:27,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:27,144 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2019-08-05 11:03:27,145 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:27,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:27,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1330040479, now seen corresponding path program 13 times [2019-08-05 11:03:27,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:27,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:03:27,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:27,337 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_23|]} [2019-08-05 11:03:27,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:27,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:27,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:27,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:27,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:27,361 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:27,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:27,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:27,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:27,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:27,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:03:27,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:03:27,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:03:27,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:27,636 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 13 states. [2019-08-05 11:03:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:28,068 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-08-05 11:03:28,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:03:28,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-05 11:03:28,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:28,069 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:03:28,069 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:03:28,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:03:28,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:03:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2019-08-05 11:03:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:03:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-08-05 11:03:28,074 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2019-08-05 11:03:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:28,074 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-08-05 11:03:28,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:03:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-08-05 11:03:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:03:28,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:28,075 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 2, 1, 1, 1, 1] [2019-08-05 11:03:28,075 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:28,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:28,076 INFO L82 PathProgramCache]: Analyzing trace with hash -396567839, now seen corresponding path program 14 times [2019-08-05 11:03:28,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:28,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:03:28,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:28,207 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|v_#valid_24|]} [2019-08-05 11:03:28,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:28,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:28,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:28,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:28,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:28,232 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:28,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:28,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:28,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:28,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:28,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:03:28,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:03:28,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:03:28,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:28,375 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 13 states. [2019-08-05 11:03:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:28,751 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-08-05 11:03:28,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:03:28,753 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-05 11:03:28,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:28,753 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:03:28,754 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:03:28,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:03:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:03:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2019-08-05 11:03:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:03:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-08-05 11:03:28,756 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2019-08-05 11:03:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:28,756 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-08-05 11:03:28,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:03:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-08-05 11:03:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:03:28,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:28,757 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:28,757 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:28,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2300831, now seen corresponding path program 15 times [2019-08-05 11:03:28,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:28,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:03:28,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:29,075 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_25|]} [2019-08-05 11:03:29,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:29,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:29,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:29,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:29,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:29,093 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:29,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:29,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:29,108 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:29,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:29,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:03:29,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:03:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:03:29,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:03:29,177 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 12 states. [2019-08-05 11:03:29,590 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:03:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:29,783 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-08-05 11:03:29,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:03:29,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-08-05 11:03:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:29,785 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:03:29,785 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:03:29,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:03:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:03:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 29. [2019-08-05 11:03:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:03:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-08-05 11:03:29,789 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2019-08-05 11:03:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:29,789 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-08-05 11:03:29,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:03:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-08-05 11:03:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:03:29,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:29,790 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2019-08-05 11:03:29,791 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:29,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:29,791 INFO L82 PathProgramCache]: Analyzing trace with hash 47271393, now seen corresponding path program 7 times [2019-08-05 11:03:29,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:29,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:03:29,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:29,881 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_25|], 1=[|v_#valid_26|]} [2019-08-05 11:03:29,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:29,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:29,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:29,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:29,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:29,900 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:29,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:29,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:29,908 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:29,948 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 11:03:29,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:29,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:03:29,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:03:29,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:03:29,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:03:29,950 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 12 states. [2019-08-05 11:03:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:30,195 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-08-05 11:03:30,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:03:30,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-08-05 11:03:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:30,196 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:03:30,197 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:03:30,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:03:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:03:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 31. [2019-08-05 11:03:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:03:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-08-05 11:03:30,201 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 20 [2019-08-05 11:03:30,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:30,201 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-08-05 11:03:30,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:03:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-08-05 11:03:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:03:30,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:30,202 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2019-08-05 11:03:30,203 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:30,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 16 times [2019-08-05 11:03:30,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:30,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:03:30,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:30,352 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_27|]} [2019-08-05 11:03:30,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:30,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:30,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:30,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:30,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:30,370 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:30,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:30,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:30,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:30,822 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 11:03:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:31,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:31,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:03:31,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:03:31,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:03:31,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:03:31,068 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 14 states. [2019-08-05 11:03:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:31,556 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-08-05 11:03:31,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:03:31,556 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 11:03:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:31,557 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:03:31,557 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:03:31,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:03:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:03:31,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-08-05 11:03:31,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:03:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-08-05 11:03:31,561 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 22 [2019-08-05 11:03:31,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:31,561 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-08-05 11:03:31,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:03:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-08-05 11:03:31,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:03:31,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:31,562 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 1, 1, 1, 1] [2019-08-05 11:03:31,562 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1150448411, now seen corresponding path program 17 times [2019-08-05 11:03:31,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:31,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:03:31,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:31,654 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_27|], 1=[|v_#valid_28|]} [2019-08-05 11:03:31,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:31,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:31,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:31,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:31,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:31,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:31,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:31,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:31,681 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:31,889 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 11:03:31,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:31,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:03:31,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:03:31,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:03:31,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:03:31,890 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 14 states. [2019-08-05 11:03:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:32,422 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-08-05 11:03:32,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:03:32,423 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 11:03:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:32,423 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:03:32,423 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:03:32,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:03:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:03:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2019-08-05 11:03:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:03:32,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-08-05 11:03:32,425 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 22 [2019-08-05 11:03:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:32,426 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-08-05 11:03:32,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:03:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-08-05 11:03:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:03:32,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:32,426 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 2, 1, 1, 1, 1] [2019-08-05 11:03:32,427 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:32,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:32,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2083921051, now seen corresponding path program 18 times [2019-08-05 11:03:32,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:32,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:03:32,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:32,534 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_29|]} [2019-08-05 11:03:32,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:32,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:32,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:32,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:32,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:32,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:32,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:32,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:32,564 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:32,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:32,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:03:32,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:03:32,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:03:32,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:03:32,684 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 14 states. [2019-08-05 11:03:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:33,096 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-08-05 11:03:33,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:03:33,096 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 11:03:33,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:33,097 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:03:33,097 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:03:33,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:03:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:03:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 33. [2019-08-05 11:03:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:03:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-08-05 11:03:33,099 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 22 [2019-08-05 11:03:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:33,100 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-08-05 11:03:33,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:03:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-08-05 11:03:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:03:33,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:33,101 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:33,101 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1816779237, now seen corresponding path program 19 times [2019-08-05 11:03:33,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:33,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:03:33,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:33,359 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_29|], 1=[|v_#valid_30|]} [2019-08-05 11:03:33,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:33,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:33,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:33,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:33,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:33,379 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:33,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:33,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:33,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:33,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:33,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:03:33,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:03:33,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:03:33,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:33,475 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 13 states. [2019-08-05 11:03:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:33,827 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-08-05 11:03:33,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:03:33,828 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-08-05 11:03:33,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:33,828 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:03:33,828 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:03:33,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:03:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 33. [2019-08-05 11:03:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:03:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-08-05 11:03:33,831 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 22 [2019-08-05 11:03:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:33,831 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-08-05 11:03:33,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:03:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-08-05 11:03:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:03:33,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:33,833 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2019-08-05 11:03:33,833 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:33,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:33,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1767207013, now seen corresponding path program 8 times [2019-08-05 11:03:33,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:33,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:03:33,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:34,001 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_31|]} [2019-08-05 11:03:34,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:34,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:34,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:34,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:34,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:34,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:34,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:34,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:34,029 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:34,075 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 11:03:34,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:34,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:03:34,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:03:34,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:03:34,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:34,076 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 13 states. [2019-08-05 11:03:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:34,354 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-08-05 11:03:34,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:03:34,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-08-05 11:03:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:34,355 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:03:34,356 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:03:34,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:03:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 35. [2019-08-05 11:03:34,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:03:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-08-05 11:03:34,359 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 22 [2019-08-05 11:03:34,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:34,359 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-08-05 11:03:34,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:03:34,359 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-08-05 11:03:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:03:34,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:34,360 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2019-08-05 11:03:34,360 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:34,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:34,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1729100629, now seen corresponding path program 20 times [2019-08-05 11:03:34,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:34,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:03:34,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:34,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:34,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:03:34,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:03:34,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:03:34,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:34,486 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 13 states. [2019-08-05 11:03:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:34,559 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-08-05 11:03:34,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:03:34,560 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-08-05 11:03:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:34,560 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:03:34,560 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:03:34,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:03:34,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:03:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:03:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-08-05 11:03:34,563 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 24 [2019-08-05 11:03:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:34,563 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-08-05 11:03:34,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:03:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-08-05 11:03:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:03:34,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:34,564 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2019-08-05 11:03:34,565 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:34,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:34,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1774380245, now seen corresponding path program 21 times [2019-08-05 11:03:34,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:34,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:03:34,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:34,694 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|], 1=[|v_#valid_32|]} [2019-08-05 11:03:34,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:34,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:34,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:34,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:34,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:34,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:34,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:34,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:34,724 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:34,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:34,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:03:34,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:03:34,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:03:34,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:34,950 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 15 states. [2019-08-05 11:03:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:35,517 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-08-05 11:03:35,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:03:35,517 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-08-05 11:03:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:35,518 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:03:35,518 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:03:35,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:03:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:03:35,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2019-08-05 11:03:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:03:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-08-05 11:03:35,521 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 24 [2019-08-05 11:03:35,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:35,521 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-08-05 11:03:35,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:03:35,521 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-08-05 11:03:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:03:35,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:35,522 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 3, 1, 1, 1, 1] [2019-08-05 11:03:35,522 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:35,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:35,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1193422421, now seen corresponding path program 22 times [2019-08-05 11:03:35,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:35,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:03:35,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:35,621 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_32|], 1=[|v_#valid_33|]} [2019-08-05 11:03:35,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:35,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:35,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:35,772 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:03:35,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:35,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:35,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:35,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:35,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:35,789 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:35,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:35,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:03:35,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:03:35,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:03:35,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:35,928 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 15 states. [2019-08-05 11:03:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:36,422 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-08-05 11:03:36,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:03:36,422 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-08-05 11:03:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:36,423 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:03:36,423 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:03:36,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:03:36,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:03:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 35. [2019-08-05 11:03:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:03:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-08-05 11:03:36,427 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 24 [2019-08-05 11:03:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:36,427 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-08-05 11:03:36,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:03:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-08-05 11:03:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:03:36,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:36,428 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 3, 2, 1, 1, 1, 1] [2019-08-05 11:03:36,428 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:36,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:36,428 INFO L82 PathProgramCache]: Analyzing trace with hash 2126895061, now seen corresponding path program 23 times [2019-08-05 11:03:36,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:36,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:03:36,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:36,553 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 1=[|v_#valid_34|]} [2019-08-05 11:03:36,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:36,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:36,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:36,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:36,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:36,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:36,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:36,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:36,583 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:36,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:36,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:03:36,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:03:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:03:36,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:36,803 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 15 states. [2019-08-05 11:03:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:37,246 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-08-05 11:03:37,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:03:37,246 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-08-05 11:03:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:37,247 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:03:37,248 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:03:37,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:03:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:03:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 35. [2019-08-05 11:03:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:03:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-08-05 11:03:37,251 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 24 [2019-08-05 11:03:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:37,251 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-08-05 11:03:37,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:03:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-08-05 11:03:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:03:37,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:37,252 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:37,252 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:37,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:37,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1773805227, now seen corresponding path program 24 times [2019-08-05 11:03:37,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:37,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:03:37,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:37,670 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_34|], 1=[|v_#valid_35|]} [2019-08-05 11:03:37,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:37,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:37,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:37,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:37,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:37,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:37,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:37,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:37,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:37,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:37,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:03:37,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:03:37,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:03:37,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:03:37,779 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 14 states. [2019-08-05 11:03:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:38,158 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-08-05 11:03:38,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:03:38,158 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-08-05 11:03:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:38,159 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:03:38,159 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:03:38,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:03:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:03:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 35. [2019-08-05 11:03:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:03:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-08-05 11:03:38,162 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 24 [2019-08-05 11:03:38,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:38,162 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-08-05 11:03:38,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:03:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-08-05 11:03:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:03:38,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:38,163 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2019-08-05 11:03:38,163 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:38,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:38,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1724233003, now seen corresponding path program 9 times [2019-08-05 11:03:38,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:38,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:03:38,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:38,293 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_35|], 1=[|v_#valid_36|]} [2019-08-05 11:03:38,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:38,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:38,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:38,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:38,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:38,312 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:38,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:38,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:38,321 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:38,364 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 11:03:38,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:38,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:03:38,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:03:38,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:03:38,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:03:38,365 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 14 states. [2019-08-05 11:03:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:38,694 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-08-05 11:03:38,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:03:38,695 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-08-05 11:03:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:38,696 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:03:38,696 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:03:38,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:03:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:03:38,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 37. [2019-08-05 11:03:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:03:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-08-05 11:03:38,699 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 24 [2019-08-05 11:03:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:38,700 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-08-05 11:03:38,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:03:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-08-05 11:03:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:03:38,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:38,700 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2019-08-05 11:03:38,701 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:38,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:38,701 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 25 times [2019-08-05 11:03:38,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:38,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:03:38,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:38,844 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_37|]} [2019-08-05 11:03:38,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:38,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:38,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:38,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:38,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:38,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:38,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:38,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:38,873 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:39,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:39,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:03:39,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:03:39,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:03:39,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:03:39,061 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 16 states. [2019-08-05 11:03:39,598 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-08-05 11:03:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:39,792 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-08-05 11:03:39,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:03:39,793 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 11:03:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:39,794 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:03:39,794 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:03:39,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:03:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:03:39,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2019-08-05 11:03:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:03:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-08-05 11:03:39,797 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 26 [2019-08-05 11:03:39,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:39,797 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-08-05 11:03:39,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:03:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-08-05 11:03:39,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:03:39,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:39,798 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 4, 1, 1, 1, 1] [2019-08-05 11:03:39,798 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:39,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:39,799 INFO L82 PathProgramCache]: Analyzing trace with hash 122730895, now seen corresponding path program 26 times [2019-08-05 11:03:39,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:39,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:03:39,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:40,160 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_37|], 1=[|v_#valid_38|]} [2019-08-05 11:03:40,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:40,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:40,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:40,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:40,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:40,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:40,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:40,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:40,187 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:40,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:40,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:03:40,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:03:40,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:03:40,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:03:40,359 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 16 states. [2019-08-05 11:03:40,798 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-08-05 11:03:41,032 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-08-05 11:03:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:41,148 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-08-05 11:03:41,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:03:41,150 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 11:03:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:41,151 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:03:41,151 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:03:41,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:03:41,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:03:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 39. [2019-08-05 11:03:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:03:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-08-05 11:03:41,154 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 26 [2019-08-05 11:03:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:41,155 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-08-05 11:03:41,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:03:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-08-05 11:03:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:03:41,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:41,155 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 3, 1, 1, 1, 1] [2019-08-05 11:03:41,156 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:41,156 INFO L82 PathProgramCache]: Analyzing trace with hash -458226929, now seen corresponding path program 27 times [2019-08-05 11:03:41,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:41,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:03:41,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:41,297 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_39|]} [2019-08-05 11:03:41,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:41,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:41,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:41,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:41,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:41,312 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:41,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:41,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:41,322 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:41,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:41,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:03:41,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:03:41,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:03:41,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:03:41,695 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 16 states. [2019-08-05 11:03:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:42,220 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2019-08-05 11:03:42,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:03:42,222 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 11:03:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:42,223 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:03:42,223 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:03:42,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:03:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:03:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 39. [2019-08-05 11:03:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:03:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-08-05 11:03:42,225 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 26 [2019-08-05 11:03:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:42,225 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-08-05 11:03:42,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:03:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-08-05 11:03:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:03:42,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:42,226 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 3, 2, 1, 1, 1, 1] [2019-08-05 11:03:42,226 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:42,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:42,226 INFO L82 PathProgramCache]: Analyzing trace with hash 475245711, now seen corresponding path program 28 times [2019-08-05 11:03:42,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:42,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:03:42,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:42,940 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_39|], 1=[|v_#valid_40|]} [2019-08-05 11:03:42,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:42,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:42,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:42,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:42,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:42,960 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:42,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:42,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:42,977 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:43,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:43,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:03:43,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:03:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:03:43,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:03:43,128 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 16 states. [2019-08-05 11:03:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:43,647 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-08-05 11:03:43,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:03:43,647 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 11:03:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:43,648 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:03:43,648 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:03:43,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:03:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:03:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 39. [2019-08-05 11:03:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:03:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-08-05 11:03:43,651 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 26 [2019-08-05 11:03:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:43,651 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-08-05 11:03:43,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:03:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-08-05 11:03:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:03:43,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:43,652 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:43,652 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:43,653 INFO L82 PathProgramCache]: Analyzing trace with hash 869512719, now seen corresponding path program 29 times [2019-08-05 11:03:43,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:43,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:03:43,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:43,829 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_40|], 1=[|v_#valid_41|]} [2019-08-05 11:03:43,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:43,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:43,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:43,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:43,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:43,868 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:43,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:43,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:43,882 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:43,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:43,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:03:43,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:03:43,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:03:43,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:43,976 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 15 states. [2019-08-05 11:03:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:44,382 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2019-08-05 11:03:44,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:03:44,383 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-08-05 11:03:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:44,383 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:03:44,384 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:03:44,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:03:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:03:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 39. [2019-08-05 11:03:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:03:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-08-05 11:03:44,387 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 26 [2019-08-05 11:03:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:44,387 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-08-05 11:03:44,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:03:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-08-05 11:03:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:03:44,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:44,388 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2019-08-05 11:03:44,388 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:44,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:44,388 INFO L82 PathProgramCache]: Analyzing trace with hash 919084943, now seen corresponding path program 10 times [2019-08-05 11:03:44,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:44,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:03:44,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:44,695 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_41|], 1=[|v_#valid_42|]} [2019-08-05 11:03:44,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:44,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:44,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:44,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:44,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:44,724 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:44,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:44,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:44,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:44,787 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 11:03:44,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:44,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:03:44,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:03:44,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:03:44,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:44,788 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 15 states. [2019-08-05 11:03:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:45,149 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2019-08-05 11:03:45,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:03:45,150 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-08-05 11:03:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:45,150 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:03:45,151 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:03:45,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:03:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 41. [2019-08-05 11:03:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:03:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-08-05 11:03:45,153 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 26 [2019-08-05 11:03:45,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:45,154 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-08-05 11:03:45,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:03:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-08-05 11:03:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:03:45,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:45,154 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2019-08-05 11:03:45,154 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:45,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1416287433, now seen corresponding path program 30 times [2019-08-05 11:03:45,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:45,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:03:45,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:45,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:45,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:03:45,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:03:45,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:03:45,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:45,277 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 15 states. [2019-08-05 11:03:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:45,337 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-08-05 11:03:45,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:03:45,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-08-05 11:03:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:45,338 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:03:45,338 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:03:45,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:03:45,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:03:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:03:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-08-05 11:03:45,341 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 28 [2019-08-05 11:03:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:45,341 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-08-05 11:03:45,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:03:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-08-05 11:03:45,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:03:45,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:45,342 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2019-08-05 11:03:45,343 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:45,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:45,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1980325449, now seen corresponding path program 31 times [2019-08-05 11:03:45,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:45,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:03:45,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:45,668 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_42|], 1=[|v_#valid_43|]} [2019-08-05 11:03:45,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:45,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:45,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:45,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:45,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:45,690 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:45,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:45,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:45,700 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:45,913 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 11:03:45,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:45,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:03:45,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:03:45,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:03:45,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:45,914 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 17 states. [2019-08-05 11:03:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:46,545 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-08-05 11:03:46,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:03:46,545 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 11:03:46,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:46,546 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:03:46,546 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:03:46,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:03:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:03:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2019-08-05 11:03:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:03:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-08-05 11:03:46,549 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 28 [2019-08-05 11:03:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:46,550 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-08-05 11:03:46,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:03:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-08-05 11:03:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:03:46,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:46,551 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 4, 1, 1, 1, 1] [2019-08-05 11:03:46,551 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:46,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:46,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2025605065, now seen corresponding path program 32 times [2019-08-05 11:03:46,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:46,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:03:46,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:46,700 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_43|], 1=[|v_#valid_44|]} [2019-08-05 11:03:46,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:46,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:46,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:46,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:46,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:46,717 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:46,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:46,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:46,724 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:46,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:46,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:03:46,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:03:46,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:03:46,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:46,962 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 17 states. [2019-08-05 11:03:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:47,479 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2019-08-05 11:03:47,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:03:47,480 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 11:03:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:47,480 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:03:47,481 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:03:47,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:03:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:03:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2019-08-05 11:03:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:03:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-08-05 11:03:47,484 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 28 [2019-08-05 11:03:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:47,484 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-08-05 11:03:47,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:03:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-08-05 11:03:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:03:47,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:47,485 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 3, 1, 1, 1, 1] [2019-08-05 11:03:47,485 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:47,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:47,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1444647241, now seen corresponding path program 33 times [2019-08-05 11:03:47,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:47,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:03:47,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:47,715 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_44|], 1=[|v_#valid_45|]} [2019-08-05 11:03:47,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:47,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:47,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:47,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:47,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:47,745 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:47,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:47,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:47,757 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:48,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:48,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:03:48,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:03:48,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:03:48,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:48,065 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 17 states. [2019-08-05 11:03:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:48,670 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-08-05 11:03:48,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:03:48,671 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 11:03:48,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:48,672 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:03:48,672 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:03:48,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:03:48,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:03:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 41. [2019-08-05 11:03:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:03:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-08-05 11:03:48,674 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 28 [2019-08-05 11:03:48,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:48,675 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-08-05 11:03:48,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:03:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-08-05 11:03:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:03:48,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:48,675 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 3, 2, 1, 1, 1, 1] [2019-08-05 11:03:48,675 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:48,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:48,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1916847415, now seen corresponding path program 34 times [2019-08-05 11:03:48,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:48,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:03:48,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:49,188 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_45|], 1=[|v_#valid_46|]} [2019-08-05 11:03:49,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:49,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:49,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:49,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:49,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:49,205 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:49,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:49,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:49,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:49,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:49,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:03:49,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:03:49,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:03:49,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:49,406 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 17 states. [2019-08-05 11:03:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:49,912 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-08-05 11:03:49,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:03:49,913 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 11:03:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:49,914 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:03:49,914 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:03:49,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:03:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:03:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 41. [2019-08-05 11:03:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:03:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-08-05 11:03:49,917 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 28 [2019-08-05 11:03:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:49,917 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-08-05 11:03:49,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:03:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-08-05 11:03:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:03:49,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:49,917 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:49,917 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1522580407, now seen corresponding path program 35 times [2019-08-05 11:03:49,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:49,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:03:49,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:50,207 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_46|], 1=[|v_#valid_47|]} [2019-08-05 11:03:50,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:50,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:50,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:50,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:50,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:50,255 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:50,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:50,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:50,263 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:50,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:50,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:03:50,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:03:50,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:03:50,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:03:50,358 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 16 states. [2019-08-05 11:03:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:50,803 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2019-08-05 11:03:50,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:03:50,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-08-05 11:03:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:50,804 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:03:50,805 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:03:50,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:03:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:03:50,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 41. [2019-08-05 11:03:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:03:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-08-05 11:03:50,807 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 28 [2019-08-05 11:03:50,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:50,808 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-08-05 11:03:50,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:03:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-08-05 11:03:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:03:50,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:50,808 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2019-08-05 11:03:50,809 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:50,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:50,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1473008183, now seen corresponding path program 11 times [2019-08-05 11:03:50,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:50,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:03:50,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:50,934 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_47|], 1=[|v_#valid_48|]} [2019-08-05 11:03:50,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:50,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:50,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:50,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:50,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:50,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:50,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:50,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:50,962 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:51,011 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 11:03:51,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:51,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:03:51,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:03:51,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:03:51,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:03:51,013 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 16 states. [2019-08-05 11:03:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:51,409 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2019-08-05 11:03:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:03:51,409 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-08-05 11:03:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:51,410 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:03:51,410 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:03:51,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:03:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:03:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 43. [2019-08-05 11:03:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:03:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-08-05 11:03:51,413 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 28 [2019-08-05 11:03:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:51,414 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-08-05 11:03:51,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:03:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-08-05 11:03:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:03:51,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:51,414 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2019-08-05 11:03:51,414 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:51,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:51,415 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 36 times [2019-08-05 11:03:51,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:51,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:03:51,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:51,513 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_48|], 1=[|v_#valid_49|]} [2019-08-05 11:03:51,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:51,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:51,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:51,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:51,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:51,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:51,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:51,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:51,544 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:51,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:51,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:03:51,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:03:51,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:03:51,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:03:51,763 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 18 states. [2019-08-05 11:03:52,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:52,395 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2019-08-05 11:03:52,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:03:52,395 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 11:03:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:52,396 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:03:52,396 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:03:52,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:03:52,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:03:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2019-08-05 11:03:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:03:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-08-05 11:03:52,399 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 30 [2019-08-05 11:03:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:52,400 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-08-05 11:03:52,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:03:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-08-05 11:03:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:03:52,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:52,400 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 5, 1, 1, 1, 1] [2019-08-05 11:03:52,401 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:52,401 INFO L82 PathProgramCache]: Analyzing trace with hash 986334723, now seen corresponding path program 37 times [2019-08-05 11:03:52,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:52,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:03:52,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:52,993 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_49|], 1=[|v_#valid_50|]} [2019-08-05 11:03:52,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:52,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:52,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:53,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:53,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:53,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:53,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:53,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:53,019 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:53,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:53,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:03:53,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:03:53,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:03:53,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:03:53,208 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 18 states. [2019-08-05 11:03:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:53,814 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-08-05 11:03:53,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:03:53,814 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 11:03:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:53,815 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:03:53,815 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:03:53,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:03:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:03:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 45. [2019-08-05 11:03:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:03:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-08-05 11:03:53,818 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 30 [2019-08-05 11:03:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:53,819 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-08-05 11:03:53,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:03:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-08-05 11:03:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:03:53,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:53,820 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 4, 1, 1, 1, 1] [2019-08-05 11:03:53,820 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1031614339, now seen corresponding path program 38 times [2019-08-05 11:03:53,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:53,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:03:53,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:53,992 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_50|], 1=[|v_#valid_51|]} [2019-08-05 11:03:54,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:54,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:54,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:54,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:54,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:54,022 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:54,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:54,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:54,032 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:54,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:54,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:03:54,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:03:54,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:03:54,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:03:54,241 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 18 states. [2019-08-05 11:03:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:54,830 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2019-08-05 11:03:54,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:03:54,831 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 11:03:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:54,832 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:03:54,832 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:03:54,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:03:54,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:03:54,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 45. [2019-08-05 11:03:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:03:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-08-05 11:03:54,835 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 30 [2019-08-05 11:03:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:54,835 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-08-05 11:03:54,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:03:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-08-05 11:03:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:03:54,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:54,836 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 4, 3, 1, 1, 1, 1] [2019-08-05 11:03:54,836 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:54,837 INFO L82 PathProgramCache]: Analyzing trace with hash 450656515, now seen corresponding path program 39 times [2019-08-05 11:03:54,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:54,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:03:54,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:54,932 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_51|], 1=[|v_#valid_52|]} [2019-08-05 11:03:54,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:54,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:54,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:54,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:54,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:54,949 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:54,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:54,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:54,957 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:55,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:55,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:03:55,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:03:55,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:03:55,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:03:55,138 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 18 states. [2019-08-05 11:03:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:55,782 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2019-08-05 11:03:55,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:03:55,782 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 11:03:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:55,783 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:03:55,784 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:03:55,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:03:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:03:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 45. [2019-08-05 11:03:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:03:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-08-05 11:03:55,786 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 30 [2019-08-05 11:03:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:55,786 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-08-05 11:03:55,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:03:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-08-05 11:03:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:03:55,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:55,787 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 3, 2, 1, 1, 1, 1] [2019-08-05 11:03:55,787 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:55,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1384129155, now seen corresponding path program 40 times [2019-08-05 11:03:55,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:55,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:03:55,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:56,107 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 1=[|v_#valid_53|]} [2019-08-05 11:03:56,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:56,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:56,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:56,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:56,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:56,125 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:56,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:56,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:56,136 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:56,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:56,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:03:56,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:03:56,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:03:56,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:03:56,269 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 18 states. [2019-08-05 11:03:57,267 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-08-05 11:03:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:57,613 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2019-08-05 11:03:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:03:57,613 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 11:03:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:57,614 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:03:57,614 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:03:57,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:03:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:03:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 45. [2019-08-05 11:03:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:03:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-08-05 11:03:57,617 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 30 [2019-08-05 11:03:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:57,617 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-08-05 11:03:57,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:03:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-08-05 11:03:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:03:57,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:57,617 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 2, 1, 1, 1, 1, 1] [2019-08-05 11:03:57,618 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:57,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1778396163, now seen corresponding path program 41 times [2019-08-05 11:03:57,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:57,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:03:57,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:57,781 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_53|], 1=[|v_#valid_54|]} [2019-08-05 11:03:57,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:57,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:57,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:57,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:57,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:57,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:57,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:57,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:57,819 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:57,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:57,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:03:57,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:03:57,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:03:57,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:57,990 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 17 states. [2019-08-05 11:03:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:58,576 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-08-05 11:03:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:03:58,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-08-05 11:03:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:58,577 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:03:58,578 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:03:58,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:03:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:03:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 45. [2019-08-05 11:03:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:03:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-08-05 11:03:58,581 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 30 [2019-08-05 11:03:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:58,581 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-08-05 11:03:58,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:03:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-08-05 11:03:58,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:03:58,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:58,582 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2019-08-05 11:03:58,582 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:58,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:58,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1827968387, now seen corresponding path program 12 times [2019-08-05 11:03:58,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:58,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:03:58,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:58,695 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_54|], 1=[|v_#valid_55|]} [2019-08-05 11:03:58,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:58,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:58,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:58,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:58,715 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:58,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:58,725 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:03:58,775 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 11:03:58,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:58,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:03:58,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:03:58,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:03:58,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:58,777 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 17 states. [2019-08-05 11:03:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:59,260 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-08-05 11:03:59,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:03:59,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-08-05 11:03:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:59,262 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:03:59,262 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:03:59,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:03:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:03:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 47. [2019-08-05 11:03:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:03:59,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-08-05 11:03:59,264 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 30 [2019-08-05 11:03:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:59,265 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-08-05 11:03:59,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:03:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-08-05 11:03:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:03:59,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:59,265 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1] [2019-08-05 11:03:59,266 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:59,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2100261949, now seen corresponding path program 42 times [2019-08-05 11:03:59,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:59,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:03:59,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:59,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:59,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:03:59,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:03:59,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:03:59,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:59,510 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 17 states. [2019-08-05 11:03:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:59,602 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2019-08-05 11:03:59,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:03:59,603 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-08-05 11:03:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:59,603 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:03:59,603 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:03:59,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:03:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:03:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:03:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-08-05 11:03:59,606 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 32 [2019-08-05 11:03:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:59,606 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-08-05 11:03:59,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:03:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-08-05 11:03:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:03:59,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:59,607 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1] [2019-08-05 11:03:59,608 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:59,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:59,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1320051267, now seen corresponding path program 43 times [2019-08-05 11:03:59,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:59,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:03:59,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:59,679 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 1=[|v_#valid_56|]} [2019-08-05 11:03:59,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:59,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:59,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:59,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:59,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:03:59,696 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:59,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:59,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:59,704 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:00,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:00,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:04:00,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:04:00,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:04:00,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:00,141 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 19 states. [2019-08-05 11:04:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:00,794 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2019-08-05 11:04:00,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:00,795 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 11:04:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:00,795 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:04:00,796 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:04:00,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:04:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:04:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2019-08-05 11:04:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:04:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-08-05 11:04:00,799 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 32 [2019-08-05 11:04:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:00,799 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-08-05 11:04:00,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-08-05 11:04:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:04:00,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:00,800 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 5, 1, 1, 1, 1] [2019-08-05 11:04:00,800 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:00,801 INFO L82 PathProgramCache]: Analyzing trace with hash -756013251, now seen corresponding path program 44 times [2019-08-05 11:04:00,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:00,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:04:00,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:00,896 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_56|], 1=[|v_#valid_57|]} [2019-08-05 11:04:00,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:00,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:00,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:00,914 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:00,921 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:01,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:01,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:04:01,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:04:01,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:04:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:01,119 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 19 states. [2019-08-05 11:04:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:01,783 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-08-05 11:04:01,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:01,784 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 11:04:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:01,785 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:04:01,785 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:04:01,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:04:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:04:01,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 47. [2019-08-05 11:04:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:04:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-08-05 11:04:01,788 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 32 [2019-08-05 11:04:01,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:01,788 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-08-05 11:04:01,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-08-05 11:04:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:04:01,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:01,789 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 4, 1, 1, 1, 1] [2019-08-05 11:04:01,789 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:01,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:01,789 INFO L82 PathProgramCache]: Analyzing trace with hash -710733635, now seen corresponding path program 45 times [2019-08-05 11:04:01,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:01,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:04:01,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:01,916 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 1=[|v_#valid_58|]} [2019-08-05 11:04:01,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:01,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:01,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:01,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:01,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:01,934 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:01,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:01,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:01,944 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:02,140 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 11:04:02,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:02,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:04:02,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:04:02,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:04:02,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:02,141 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 19 states. [2019-08-05 11:04:02,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:02,822 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2019-08-05 11:04:02,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:02,823 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 11:04:02,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:02,824 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:04:02,824 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:04:02,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:04:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:04:02,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 47. [2019-08-05 11:04:02,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:04:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-08-05 11:04:02,826 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 32 [2019-08-05 11:04:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:02,827 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-08-05 11:04:02,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-08-05 11:04:02,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:04:02,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:02,828 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 4, 3, 1, 1, 1, 1] [2019-08-05 11:04:02,828 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:02,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:02,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1291691459, now seen corresponding path program 46 times [2019-08-05 11:04:02,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:02,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:04:02,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:03,114 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_58|], 1=[|v_#valid_59|]} [2019-08-05 11:04:03,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:03,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:03,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:03,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:03,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:03,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:03,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:04:03,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:04:03,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:04:03,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:03,422 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 19 states. [2019-08-05 11:04:04,863 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-08-05 11:04:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:04,929 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2019-08-05 11:04:04,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:04,930 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 11:04:04,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:04,930 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:04:04,931 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:04:04,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:04:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:04:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 47. [2019-08-05 11:04:04,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:04:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-08-05 11:04:04,934 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 32 [2019-08-05 11:04:04,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:04,935 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-08-05 11:04:04,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-08-05 11:04:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:04:04,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:04,936 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 3, 2, 1, 1, 1, 1] [2019-08-05 11:04:04,936 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:04,936 INFO L82 PathProgramCache]: Analyzing trace with hash -358218819, now seen corresponding path program 47 times [2019-08-05 11:04:04,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:04,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:04:04,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:05,039 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_59|], 1=[|v_#valid_60|]} [2019-08-05 11:04:05,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:05,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:05,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:05,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:05,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:05,106 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:05,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:05,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:05,116 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:05,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:05,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:04:05,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:04:05,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:04:05,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:05,256 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 19 states. [2019-08-05 11:04:05,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:05,967 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-08-05 11:04:05,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:05,968 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 11:04:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:05,969 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:04:05,969 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:04:05,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:04:05,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:04:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 47. [2019-08-05 11:04:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:04:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-08-05 11:04:05,972 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 32 [2019-08-05 11:04:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:05,973 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-08-05 11:04:05,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:05,973 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-08-05 11:04:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:04:05,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:05,973 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 2, 1, 1, 1, 1, 1] [2019-08-05 11:04:05,974 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:05,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:05,974 INFO L82 PathProgramCache]: Analyzing trace with hash 36048189, now seen corresponding path program 48 times [2019-08-05 11:04:05,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:05,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:04:05,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:06,108 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_60|], 1=[|v_#valid_61|]} [2019-08-05 11:04:06,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:06,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:06,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:06,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:06,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:06,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:06,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:06,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:06,138 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:06,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:06,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:04:06,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:04:06,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:04:06,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:04:06,216 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 18 states. [2019-08-05 11:04:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:06,843 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-08-05 11:04:06,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:06,845 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-08-05 11:04:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:06,846 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:04:06,846 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:04:06,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:06,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:04:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 47. [2019-08-05 11:04:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:04:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-08-05 11:04:06,848 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 32 [2019-08-05 11:04:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:06,848 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-08-05 11:04:06,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:04:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-08-05 11:04:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:04:06,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:06,849 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2019-08-05 11:04:06,849 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash 85620413, now seen corresponding path program 13 times [2019-08-05 11:04:06,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:06,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:04:06,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:06,974 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_61|], 1=[|v_#valid_62|]} [2019-08-05 11:04:06,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:06,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:06,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:06,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:06,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:06,993 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:07,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:07,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:07,003 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:07,057 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 11:04:07,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:07,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:04:07,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:04:07,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:04:07,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:04:07,059 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 18 states. [2019-08-05 11:04:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:07,644 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2019-08-05 11:04:07,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:04:07,645 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-08-05 11:04:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:07,646 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:04:07,646 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:04:07,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:04:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 49. [2019-08-05 11:04:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:04:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-08-05 11:04:07,648 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 32 [2019-08-05 11:04:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:07,648 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-08-05 11:04:07,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:04:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-08-05 11:04:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:04:07,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:07,649 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2019-08-05 11:04:07,649 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:07,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:07,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 49 times [2019-08-05 11:04:07,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:07,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:04:07,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:07,737 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_62|], 1=[|v_#valid_63|]} [2019-08-05 11:04:07,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:07,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:07,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:07,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:07,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:07,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:07,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:07,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:07,771 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:08,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:08,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:08,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:08,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:08,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:08,180 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 20 states. [2019-08-05 11:04:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:09,013 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2019-08-05 11:04:09,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:09,014 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 11:04:09,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:09,015 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:04:09,015 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:04:09,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:04:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:04:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2019-08-05 11:04:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:04:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-08-05 11:04:09,018 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 34 [2019-08-05 11:04:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:09,018 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-08-05 11:04:09,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-08-05 11:04:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:04:09,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:09,019 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 6, 1, 1, 1, 1] [2019-08-05 11:04:09,019 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash -679208841, now seen corresponding path program 50 times [2019-08-05 11:04:09,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:09,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:04:09,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:09,245 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_63|], 1=[|v_#valid_64|]} [2019-08-05 11:04:09,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:09,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:09,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:09,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:09,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:09,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:09,281 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:09,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:09,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:09,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:09,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:09,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:09,508 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 20 states. [2019-08-05 11:04:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:10,277 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2019-08-05 11:04:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:10,277 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 11:04:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:10,278 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:04:10,278 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:04:10,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:04:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:04:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 51. [2019-08-05 11:04:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:04:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-08-05 11:04:10,281 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 34 [2019-08-05 11:04:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:10,281 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-08-05 11:04:10,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-08-05 11:04:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:04:10,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:10,282 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 5, 1, 1, 1, 1] [2019-08-05 11:04:10,282 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:10,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash -115170825, now seen corresponding path program 51 times [2019-08-05 11:04:10,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:10,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:04:10,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:10,394 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_64|], 1=[|v_#valid_65|]} [2019-08-05 11:04:10,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:10,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:10,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:10,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:10,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:10,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:10,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:10,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:10,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:10,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:10,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:10,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:10,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:10,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:10,647 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 20 states. [2019-08-05 11:04:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:11,436 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-08-05 11:04:11,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:11,436 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 11:04:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:11,437 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:04:11,437 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:04:11,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:04:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:04:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 51. [2019-08-05 11:04:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:04:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-08-05 11:04:11,440 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 34 [2019-08-05 11:04:11,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:11,440 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-08-05 11:04:11,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-08-05 11:04:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:04:11,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:11,441 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 4, 1, 1, 1, 1] [2019-08-05 11:04:11,441 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash -69891209, now seen corresponding path program 52 times [2019-08-05 11:04:11,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:11,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:04:11,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:11,669 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_65|], 1=[|v_#valid_66|]} [2019-08-05 11:04:11,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:11,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:11,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:11,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:11,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:11,685 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:11,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:11,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:11,694 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:11,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:11,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:11,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:11,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:11,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:11,907 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 20 states. [2019-08-05 11:04:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:12,695 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2019-08-05 11:04:12,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:12,696 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 11:04:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:12,697 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:04:12,697 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:04:12,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:04:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:04:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 51. [2019-08-05 11:04:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:04:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-08-05 11:04:12,700 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 34 [2019-08-05 11:04:12,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:12,700 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-08-05 11:04:12,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-08-05 11:04:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:04:12,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:12,701 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 4, 3, 1, 1, 1, 1] [2019-08-05 11:04:12,701 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:12,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash -650849033, now seen corresponding path program 53 times [2019-08-05 11:04:12,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:12,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:04:12,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:12,864 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_66|], 1=[|v_#valid_67|]} [2019-08-05 11:04:12,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:12,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:12,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:12,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:12,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:12,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:12,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:12,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:12,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:13,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:13,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:13,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:13,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:13,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:13,105 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 20 states. [2019-08-05 11:04:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:14,006 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2019-08-05 11:04:14,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:14,007 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 11:04:14,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:14,008 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:04:14,008 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:04:14,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:04:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:04:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 51. [2019-08-05 11:04:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:04:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-08-05 11:04:14,012 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 34 [2019-08-05 11:04:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:14,012 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-08-05 11:04:14,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-08-05 11:04:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:04:14,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:14,013 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 3, 2, 1, 1, 1, 1] [2019-08-05 11:04:14,013 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:14,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:14,014 INFO L82 PathProgramCache]: Analyzing trace with hash 282623607, now seen corresponding path program 54 times [2019-08-05 11:04:14,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:14,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:04:14,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:14,156 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_67|], 1=[|v_#valid_68|]} [2019-08-05 11:04:14,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:14,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:14,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:14,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:14,174 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:14,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:14,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:14,184 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:14,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:14,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:14,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:14,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:14,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:14,328 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 20 states. [2019-08-05 11:04:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:15,086 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-08-05 11:04:15,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:15,086 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 11:04:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:15,088 INFO L225 Difference]: With dead ends: 128 [2019-08-05 11:04:15,088 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 11:04:15,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:04:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 11:04:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 51. [2019-08-05 11:04:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:04:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-08-05 11:04:15,091 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 34 [2019-08-05 11:04:15,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:15,091 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-08-05 11:04:15,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-08-05 11:04:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:04:15,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:15,092 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 2, 1, 1, 1, 1, 1] [2019-08-05 11:04:15,092 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:15,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:15,092 INFO L82 PathProgramCache]: Analyzing trace with hash 676890615, now seen corresponding path program 55 times [2019-08-05 11:04:15,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:15,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:04:15,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:16,250 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_68|], 1=[|v_#valid_69|]} [2019-08-05 11:04:16,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:16,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:16,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:16,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:16,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:16,268 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:16,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:16,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:16,277 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:16,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:16,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:04:16,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:04:16,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:04:16,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:16,358 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 19 states. [2019-08-05 11:04:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:17,002 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2019-08-05 11:04:17,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:17,003 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-08-05 11:04:17,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:17,004 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:04:17,004 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 11:04:17,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:17,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 11:04:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 51. [2019-08-05 11:04:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:04:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-08-05 11:04:17,007 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 34 [2019-08-05 11:04:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:17,007 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-08-05 11:04:17,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-08-05 11:04:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:04:17,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:17,008 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2019-08-05 11:04:17,008 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:17,009 INFO L82 PathProgramCache]: Analyzing trace with hash 726462839, now seen corresponding path program 14 times [2019-08-05 11:04:17,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:17,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:04:17,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:18,693 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_69|], 1=[|v_#valid_70|]} [2019-08-05 11:04:18,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:18,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:18,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:18,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:18,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:18,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:18,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:18,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:18,722 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:18,776 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 11:04:18,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:18,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:04:18,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:04:18,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:04:18,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:18,777 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 19 states. [2019-08-05 11:04:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:19,366 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2019-08-05 11:04:19,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:19,367 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-08-05 11:04:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:19,368 INFO L225 Difference]: With dead ends: 142 [2019-08-05 11:04:19,368 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 11:04:19,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 11:04:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 53. [2019-08-05 11:04:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:04:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-08-05 11:04:19,371 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 34 [2019-08-05 11:04:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:19,371 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-08-05 11:04:19,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-08-05 11:04:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:04:19,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:19,372 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1] [2019-08-05 11:04:19,372 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1386404273, now seen corresponding path program 56 times [2019-08-05 11:04:19,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:19,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:04:19,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:19,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:19,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:04:19,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:04:19,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:04:19,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:19,536 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 19 states. [2019-08-05 11:04:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:19,661 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2019-08-05 11:04:19,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:19,662 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-08-05 11:04:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:19,662 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:04:19,662 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:04:19,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:19,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:04:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:04:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:04:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-08-05 11:04:19,665 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 36 [2019-08-05 11:04:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:19,665 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-08-05 11:04:19,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-08-05 11:04:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:04:19,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:19,666 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1] [2019-08-05 11:04:19,666 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:19,666 INFO L82 PathProgramCache]: Analyzing trace with hash 115385137, now seen corresponding path program 57 times [2019-08-05 11:04:19,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:19,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:04:19,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:20,401 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_70|], 1=[|v_#valid_71|]} [2019-08-05 11:04:20,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:20,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:20,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:20,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:20,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:20,418 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:20,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:20,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:20,427 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:20,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:20,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:20,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:20,710 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 21 states. [2019-08-05 11:04:21,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:21,516 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2019-08-05 11:04:21,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:21,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 11:04:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:21,517 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:04:21,517 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:04:21,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:04:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:04:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2019-08-05 11:04:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:04:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-08-05 11:04:21,520 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 36 [2019-08-05 11:04:21,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:21,520 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-08-05 11:04:21,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-08-05 11:04:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:04:21,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:21,521 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 6, 1, 1, 1, 1] [2019-08-05 11:04:21,521 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:21,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:21,522 INFO L82 PathProgramCache]: Analyzing trace with hash 990039217, now seen corresponding path program 58 times [2019-08-05 11:04:21,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:21,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:04:21,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:21,932 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_71|], 1=[|v_#valid_72|]} [2019-08-05 11:04:21,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:21,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:21,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:21,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:21,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:21,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:21,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:21,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:21,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:22,245 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 11:04:22,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:22,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:22,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:22,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:22,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:22,246 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 21 states. [2019-08-05 11:04:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:23,045 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2019-08-05 11:04:23,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:23,046 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 11:04:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:23,046 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:04:23,047 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:04:23,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:04:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:04:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 53. [2019-08-05 11:04:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:04:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-08-05 11:04:23,049 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 36 [2019-08-05 11:04:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:23,049 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-08-05 11:04:23,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-08-05 11:04:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:04:23,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:23,050 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 5, 1, 1, 1, 1] [2019-08-05 11:04:23,050 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:23,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:23,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1554077233, now seen corresponding path program 59 times [2019-08-05 11:04:23,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:23,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:04:23,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:23,740 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_72|], 1=[|v_#valid_73|]} [2019-08-05 11:04:23,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:23,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:23,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:23,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:23,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:23,758 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:23,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:23,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:23,768 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:23,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:23,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:23,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:23,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:23,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:23,985 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 21 states. [2019-08-05 11:04:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:24,775 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-08-05 11:04:24,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:24,776 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 11:04:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:24,777 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:04:24,777 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:04:24,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:04:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:04:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 53. [2019-08-05 11:04:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:04:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-08-05 11:04:24,779 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 36 [2019-08-05 11:04:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:24,780 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-08-05 11:04:24,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-08-05 11:04:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:04:24,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:24,780 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 5, 4, 1, 1, 1, 1] [2019-08-05 11:04:24,781 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:24,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:24,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1599356849, now seen corresponding path program 60 times [2019-08-05 11:04:24,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:24,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:04:24,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:24,879 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_73|], 1=[|v_#valid_74|]} [2019-08-05 11:04:24,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:24,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:24,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:24,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:24,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:24,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:24,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:24,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:24,907 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:25,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:25,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:25,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:25,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:25,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:25,133 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 21 states. [2019-08-05 11:04:25,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:25,974 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-08-05 11:04:25,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:25,975 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 11:04:25,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:25,976 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:04:25,976 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:04:25,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:04:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:04:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 53. [2019-08-05 11:04:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:04:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-08-05 11:04:25,978 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 36 [2019-08-05 11:04:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:25,979 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-08-05 11:04:25,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-08-05 11:04:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:04:25,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:25,979 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 4, 3, 1, 1, 1, 1] [2019-08-05 11:04:25,979 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:25,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:25,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1018399025, now seen corresponding path program 61 times [2019-08-05 11:04:25,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:25,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:04:25,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:26,103 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_74|], 1=[|v_#valid_75|]} [2019-08-05 11:04:26,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:26,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:26,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:26,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:26,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:26,122 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:26,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:26,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:26,132 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:26,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:26,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:26,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:26,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:26,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:26,359 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 21 states. [2019-08-05 11:04:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:27,135 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2019-08-05 11:04:27,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:27,136 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 11:04:27,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:27,137 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:04:27,137 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:04:27,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:04:27,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:04:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 53. [2019-08-05 11:04:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:04:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-08-05 11:04:27,140 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 36 [2019-08-05 11:04:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:27,140 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-08-05 11:04:27,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-08-05 11:04:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:04:27,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:27,141 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 3, 2, 1, 1, 1, 1] [2019-08-05 11:04:27,141 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:27,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:27,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1951871665, now seen corresponding path program 62 times [2019-08-05 11:04:27,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:27,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:04:27,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:27,273 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_75|], 1=[|v_#valid_76|]} [2019-08-05 11:04:27,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:27,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:27,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:27,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:27,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:27,292 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:27,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:27,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:27,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:27,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:27,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:27,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:27,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:27,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:27,452 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 21 states. [2019-08-05 11:04:28,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:28,184 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-08-05 11:04:28,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:28,185 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 11:04:28,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:28,186 INFO L225 Difference]: With dead ends: 130 [2019-08-05 11:04:28,186 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 11:04:28,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:04:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 11:04:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 53. [2019-08-05 11:04:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:04:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-08-05 11:04:28,189 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 36 [2019-08-05 11:04:28,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:28,190 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-08-05 11:04:28,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-08-05 11:04:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:04:28,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:28,191 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 2, 1, 1, 1, 1, 1] [2019-08-05 11:04:28,191 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:28,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:28,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1948828623, now seen corresponding path program 63 times [2019-08-05 11:04:28,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:28,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:04:28,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:28,323 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_76|], 1=[|v_#valid_77|]} [2019-08-05 11:04:28,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:28,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:28,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:28,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:28,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:28,341 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:28,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:28,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:28,351 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:28,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:28,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:28,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:28,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:28,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:28,438 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 20 states. [2019-08-05 11:04:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:29,210 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-08-05 11:04:29,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:29,211 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-08-05 11:04:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:29,212 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:04:29,212 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:04:29,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:04:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:04:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 53. [2019-08-05 11:04:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:04:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-08-05 11:04:29,215 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 36 [2019-08-05 11:04:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:29,215 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-08-05 11:04:29,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-08-05 11:04:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:04:29,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:29,216 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2019-08-05 11:04:29,216 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:29,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1899256399, now seen corresponding path program 15 times [2019-08-05 11:04:29,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:29,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:04:29,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:29,367 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_77|], 1=[|v_#valid_78|]} [2019-08-05 11:04:29,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:29,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:29,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:29,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:29,387 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:29,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:29,398 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:29,456 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 11:04:29,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:29,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:29,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:29,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:29,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:29,458 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 20 states. [2019-08-05 11:04:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:30,094 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2019-08-05 11:04:30,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:30,095 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-08-05 11:04:30,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:30,096 INFO L225 Difference]: With dead ends: 144 [2019-08-05 11:04:30,096 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 11:04:30,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 11:04:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 55. [2019-08-05 11:04:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:04:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-08-05 11:04:30,099 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 36 [2019-08-05 11:04:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:30,099 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-08-05 11:04:30,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-08-05 11:04:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:04:30,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:30,100 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2019-08-05 11:04:30,100 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:30,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:30,101 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 64 times [2019-08-05 11:04:30,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:30,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:04:30,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:30,238 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_78|], 1=[|v_#valid_79|]} [2019-08-05 11:04:30,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:30,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:30,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:30,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:30,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:30,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:30,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:30,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:30,267 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:30,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:30,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:30,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:30,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:30,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:30,876 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 22 states. [2019-08-05 11:04:31,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:31,868 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2019-08-05 11:04:31,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:31,868 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 11:04:31,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:31,869 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:04:31,869 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:04:31,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:04:31,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:04:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2019-08-05 11:04:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:04:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-08-05 11:04:31,872 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 38 [2019-08-05 11:04:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:31,873 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-08-05 11:04:31,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-08-05 11:04:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:04:31,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:31,874 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 7, 1, 1, 1, 1] [2019-08-05 11:04:31,874 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:31,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:31,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2054999829, now seen corresponding path program 65 times [2019-08-05 11:04:31,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:31,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:04:31,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:32,116 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_79|], 1=[|v_#valid_80|]} [2019-08-05 11:04:32,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:32,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:32,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:32,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:32,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:32,134 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:32,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:32,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:32,144 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:32,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:32,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:32,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:32,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:32,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:32,418 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 22 states. [2019-08-05 11:04:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:33,324 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-08-05 11:04:33,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:33,324 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 11:04:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:33,325 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:04:33,326 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:04:33,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:04:33,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:04:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 57. [2019-08-05 11:04:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:04:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-08-05 11:04:33,329 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 38 [2019-08-05 11:04:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:33,329 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-08-05 11:04:33,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-08-05 11:04:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:04:33,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:33,330 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 6, 1, 1, 1, 1] [2019-08-05 11:04:33,330 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:33,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:33,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1180345749, now seen corresponding path program 66 times [2019-08-05 11:04:33,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:33,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:04:33,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:33,470 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_80|], 1=[|v_#valid_81|]} [2019-08-05 11:04:33,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:33,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:33,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:33,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:33,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:33,507 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:33,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:33,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:33,517 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:34,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:34,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:34,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:34,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:34,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:34,071 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 22 states. [2019-08-05 11:04:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:34,930 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2019-08-05 11:04:34,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:34,931 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 11:04:34,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:34,932 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:04:34,932 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:04:34,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:04:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:04:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 57. [2019-08-05 11:04:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:04:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-08-05 11:04:34,935 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 38 [2019-08-05 11:04:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:34,935 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-08-05 11:04:34,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-08-05 11:04:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:04:34,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:34,936 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 5, 1, 1, 1, 1] [2019-08-05 11:04:34,936 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:34,936 INFO L82 PathProgramCache]: Analyzing trace with hash -616307733, now seen corresponding path program 67 times [2019-08-05 11:04:34,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:34,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:04:34,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:35,027 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_81|], 1=[|v_#valid_82|]} [2019-08-05 11:04:35,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:35,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:35,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:35,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:35,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:35,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:35,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:35,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:35,065 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:35,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:35,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:35,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:35,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:35,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:35,318 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 22 states. [2019-08-05 11:04:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:36,139 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2019-08-05 11:04:36,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:36,139 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 11:04:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:36,140 INFO L225 Difference]: With dead ends: 124 [2019-08-05 11:04:36,140 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 11:04:36,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:04:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 11:04:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 57. [2019-08-05 11:04:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:04:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-08-05 11:04:36,143 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 38 [2019-08-05 11:04:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:36,143 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-08-05 11:04:36,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-08-05 11:04:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:04:36,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:36,144 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 5, 4, 1, 1, 1, 1] [2019-08-05 11:04:36,144 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:36,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash -571028117, now seen corresponding path program 68 times [2019-08-05 11:04:36,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:36,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:04:36,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:36,248 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_82|], 1=[|v_#valid_83|]} [2019-08-05 11:04:36,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:36,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:36,278 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:36,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:36,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:36,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:36,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:36,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:36,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:36,510 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 22 states. [2019-08-05 11:04:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:37,384 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2019-08-05 11:04:37,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:37,384 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 11:04:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:37,386 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:04:37,386 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:04:37,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:04:37,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:04:37,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 57. [2019-08-05 11:04:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:04:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-08-05 11:04:37,389 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 38 [2019-08-05 11:04:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:37,389 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-08-05 11:04:37,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-08-05 11:04:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:04:37,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:37,390 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 4, 3, 1, 1, 1, 1] [2019-08-05 11:04:37,390 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:37,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:37,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1151985941, now seen corresponding path program 69 times [2019-08-05 11:04:37,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:37,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:04:37,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:37,514 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_83|], 1=[|v_#valid_84|]} [2019-08-05 11:04:37,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:37,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:37,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:37,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:37,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:37,536 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:37,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:37,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:37,546 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:37,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:37,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:37,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:37,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:37,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:37,735 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 22 states. [2019-08-05 11:04:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:38,543 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2019-08-05 11:04:38,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:38,543 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 11:04:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:38,544 INFO L225 Difference]: With dead ends: 146 [2019-08-05 11:04:38,545 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 11:04:38,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:04:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 11:04:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 57. [2019-08-05 11:04:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:04:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-08-05 11:04:38,547 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 38 [2019-08-05 11:04:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:38,548 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-08-05 11:04:38,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-08-05 11:04:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:04:38,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:38,548 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 3, 2, 1, 1, 1, 1] [2019-08-05 11:04:38,549 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:38,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash -218513301, now seen corresponding path program 70 times [2019-08-05 11:04:38,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:38,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:04:38,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:38,667 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_84|], 1=[|v_#valid_85|]} [2019-08-05 11:04:38,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:38,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:38,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:38,685 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:38,693 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:38,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:38,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:38,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:38,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:38,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:38,954 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 22 states. [2019-08-05 11:04:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:39,890 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2019-08-05 11:04:39,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:39,891 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 11:04:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:39,892 INFO L225 Difference]: With dead ends: 154 [2019-08-05 11:04:39,892 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 11:04:39,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:04:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 11:04:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 57. [2019-08-05 11:04:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:04:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-08-05 11:04:39,895 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 38 [2019-08-05 11:04:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:39,896 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-08-05 11:04:39,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-08-05 11:04:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:04:39,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:39,896 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 2, 1, 1, 1, 1, 1] [2019-08-05 11:04:39,897 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:39,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:39,897 INFO L82 PathProgramCache]: Analyzing trace with hash 175753707, now seen corresponding path program 71 times [2019-08-05 11:04:39,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:39,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:04:39,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:40,831 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_85|], 1=[|v_#valid_86|]} [2019-08-05 11:04:40,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:40,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:40,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:40,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:40,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:40,850 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:40,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:40,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:40,861 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:40,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:40,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:40,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:40,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:40,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:40,948 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 21 states. [2019-08-05 11:04:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:41,691 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2019-08-05 11:04:41,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:41,692 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-08-05 11:04:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:41,693 INFO L225 Difference]: With dead ends: 160 [2019-08-05 11:04:41,693 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 11:04:41,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:04:41,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 11:04:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 57. [2019-08-05 11:04:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:04:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-08-05 11:04:41,696 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 38 [2019-08-05 11:04:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:41,696 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-08-05 11:04:41,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-08-05 11:04:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:04:41,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:41,697 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2019-08-05 11:04:41,697 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash 225325931, now seen corresponding path program 16 times [2019-08-05 11:04:41,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:41,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:04:41,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:42,107 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_86|], 1=[|v_#valid_87|]} [2019-08-05 11:04:42,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:42,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:42,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:42,125 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:42,135 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:42,193 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 11:04:42,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:42,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:42,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:42,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:42,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:42,195 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 21 states. [2019-08-05 11:04:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:42,896 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2019-08-05 11:04:42,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:42,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-08-05 11:04:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:42,897 INFO L225 Difference]: With dead ends: 168 [2019-08-05 11:04:42,897 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 11:04:42,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 11:04:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 59. [2019-08-05 11:04:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:04:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2019-08-05 11:04:42,899 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 38 [2019-08-05 11:04:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:42,900 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2019-08-05 11:04:42,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2019-08-05 11:04:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:04:42,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:42,900 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2019-08-05 11:04:42,900 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:42,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:42,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1786116827, now seen corresponding path program 72 times [2019-08-05 11:04:42,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:42,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:04:42,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 90 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:43,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:43,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:43,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:43,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:43,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:43,973 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 21 states. [2019-08-05 11:04:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:44,095 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2019-08-05 11:04:44,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:44,096 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-08-05 11:04:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:44,097 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:04:44,097 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:04:44,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:04:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:04:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:04:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-08-05 11:04:44,099 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 40 [2019-08-05 11:04:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:44,099 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-08-05 11:04:44,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-08-05 11:04:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:04:44,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:44,100 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2019-08-05 11:04:44,100 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:44,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:44,101 INFO L82 PathProgramCache]: Analyzing trace with hash 830172837, now seen corresponding path program 73 times [2019-08-05 11:04:44,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:44,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:04:44,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:44,210 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_87|], 1=[|v_#valid_88|]} [2019-08-05 11:04:44,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:44,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:44,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:44,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:44,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:44,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:44,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:44,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:44,234 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:44,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:44,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:04:44,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:04:44,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:04:44,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:44,516 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 23 states. [2019-08-05 11:04:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:45,449 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2019-08-05 11:04:45,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:04:45,449 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 11:04:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:45,450 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:04:45,450 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:04:45,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:04:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:04:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2019-08-05 11:04:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:04:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-08-05 11:04:45,452 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 40 [2019-08-05 11:04:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:45,453 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-08-05 11:04:45,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:04:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-08-05 11:04:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:04:45,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:45,454 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 7, 1, 1, 1, 1] [2019-08-05 11:04:45,454 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash -440846299, now seen corresponding path program 74 times [2019-08-05 11:04:45,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:45,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:04:45,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:45,530 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_88|], 1=[|v_#valid_89|]} [2019-08-05 11:04:45,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:45,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:45,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:45,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:45,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:45,547 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:45,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:45,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:45,557 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:45,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:45,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:04:45,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:04:45,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:04:45,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:45,884 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 23 states. [2019-08-05 11:04:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:46,757 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2019-08-05 11:04:46,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:04:46,758 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 11:04:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:46,759 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:04:46,759 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:04:46,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:04:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:04:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 59. [2019-08-05 11:04:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:04:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-08-05 11:04:46,761 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 40 [2019-08-05 11:04:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:46,761 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-08-05 11:04:46,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:04:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-08-05 11:04:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:04:46,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:46,762 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 6, 1, 1, 1, 1] [2019-08-05 11:04:46,762 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:46,763 INFO L82 PathProgramCache]: Analyzing trace with hash 433807781, now seen corresponding path program 75 times [2019-08-05 11:04:46,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:46,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:04:46,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:46,867 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_89|], 1=[|v_#valid_90|]} [2019-08-05 11:04:46,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:46,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:46,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:46,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:46,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:46,901 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:46,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:46,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:46,910 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:47,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:47,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:04:47,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:04:47,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:04:47,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:47,177 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 23 states. [2019-08-05 11:04:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:48,048 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-08-05 11:04:48,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:04:48,049 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 11:04:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:48,049 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:04:48,050 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:04:48,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:04:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:04:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 59. [2019-08-05 11:04:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:04:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-08-05 11:04:48,052 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 40 [2019-08-05 11:04:48,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:48,052 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-08-05 11:04:48,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:04:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-08-05 11:04:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:04:48,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:48,053 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 5, 1, 1, 1, 1] [2019-08-05 11:04:48,053 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:48,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:48,053 INFO L82 PathProgramCache]: Analyzing trace with hash 997845797, now seen corresponding path program 76 times [2019-08-05 11:04:48,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:48,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:04:48,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:48,199 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_90|], 1=[|v_#valid_91|]} [2019-08-05 11:04:48,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:48,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:48,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:48,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:48,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:48,218 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:48,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:48,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:48,228 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:48,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:48,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:04:48,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:04:48,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:04:48,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:48,462 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 23 states. [2019-08-05 11:04:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:49,429 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2019-08-05 11:04:49,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:04:49,429 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 11:04:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:49,430 INFO L225 Difference]: With dead ends: 126 [2019-08-05 11:04:49,430 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 11:04:49,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:04:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 11:04:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 59. [2019-08-05 11:04:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:04:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-08-05 11:04:49,433 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 40 [2019-08-05 11:04:49,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:49,433 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-08-05 11:04:49,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:04:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-08-05 11:04:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:04:49,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:49,434 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 5, 4, 1, 1, 1, 1] [2019-08-05 11:04:49,434 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1043125413, now seen corresponding path program 77 times [2019-08-05 11:04:49,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:49,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:04:49,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:49,538 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_91|], 1=[|v_#valid_92|]} [2019-08-05 11:04:49,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:49,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:49,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:49,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:49,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:49,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:49,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:49,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:49,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:49,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:49,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:04:49,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:04:49,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:04:49,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:49,836 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 23 states. [2019-08-05 11:04:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:50,698 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2019-08-05 11:04:50,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:04:50,699 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 11:04:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:50,700 INFO L225 Difference]: With dead ends: 138 [2019-08-05 11:04:50,700 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 11:04:50,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:04:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 11:04:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 59. [2019-08-05 11:04:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:04:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-08-05 11:04:50,702 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 40 [2019-08-05 11:04:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:50,702 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-08-05 11:04:50,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:04:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-08-05 11:04:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:04:50,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:50,703 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 4, 3, 1, 1, 1, 1] [2019-08-05 11:04:50,703 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:50,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash 462167589, now seen corresponding path program 78 times [2019-08-05 11:04:50,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:50,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:04:50,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:50,997 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_92|], 1=[|v_#valid_93|]} [2019-08-05 11:04:51,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:51,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:51,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:51,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:51,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:51,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:51,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:51,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:51,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:51,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:51,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:04:51,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:04:51,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:04:51,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:51,220 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 23 states. [2019-08-05 11:04:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:52,100 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2019-08-05 11:04:52,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:04:52,100 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 11:04:52,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:52,101 INFO L225 Difference]: With dead ends: 148 [2019-08-05 11:04:52,102 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 11:04:52,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:04:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 11:04:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 59. [2019-08-05 11:04:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:04:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-08-05 11:04:52,105 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 40 [2019-08-05 11:04:52,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:52,105 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-08-05 11:04:52,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:04:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-08-05 11:04:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:04:52,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:52,106 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 3, 2, 1, 1, 1, 1] [2019-08-05 11:04:52,106 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:52,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1395640229, now seen corresponding path program 79 times [2019-08-05 11:04:52,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:52,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:04:52,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:52,270 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_93|], 1=[|v_#valid_94|]} [2019-08-05 11:04:52,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:52,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:52,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:52,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:52,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:52,342 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:52,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:52,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:52,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:52,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:52,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:04:52,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:04:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:04:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:52,671 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 23 states. [2019-08-05 11:04:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:53,557 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2019-08-05 11:04:53,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:04:53,558 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 11:04:53,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:53,559 INFO L225 Difference]: With dead ends: 156 [2019-08-05 11:04:53,559 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 11:04:53,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:04:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 11:04:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 59. [2019-08-05 11:04:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:04:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-08-05 11:04:53,562 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 40 [2019-08-05 11:04:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:53,562 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-08-05 11:04:53,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:04:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-08-05 11:04:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:04:53,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:53,563 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 2, 1, 1, 1, 1, 1] [2019-08-05 11:04:53,563 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:53,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:53,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1789907237, now seen corresponding path program 80 times [2019-08-05 11:04:53,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:53,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:04:53,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:53,741 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_94|], 1=[|v_#valid_95|]} [2019-08-05 11:04:53,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:53,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:53,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:53,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:53,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:53,759 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:53,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:53,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:53,769 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:53,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:53,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:53,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:53,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:53,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:53,857 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 22 states. [2019-08-05 11:04:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:54,742 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2019-08-05 11:04:54,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:04:54,743 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-08-05 11:04:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:54,744 INFO L225 Difference]: With dead ends: 162 [2019-08-05 11:04:54,744 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 11:04:54,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:04:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 11:04:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 59. [2019-08-05 11:04:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:04:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-08-05 11:04:54,746 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 40 [2019-08-05 11:04:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:54,746 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-08-05 11:04:54,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-08-05 11:04:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:04:54,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:54,747 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2019-08-05 11:04:54,747 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:54,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:54,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1839479461, now seen corresponding path program 17 times [2019-08-05 11:04:54,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:54,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:04:54,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:55,169 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_95|], 1=[|v_#valid_96|]} [2019-08-05 11:04:55,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:55,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:55,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:55,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:55,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:55,186 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:55,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:55,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:55,196 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:55,252 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 11:04:55,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:55,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:55,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:55,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:55,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:55,253 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 22 states. [2019-08-05 11:04:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:55,965 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2019-08-05 11:04:55,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:55,966 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-08-05 11:04:55,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:55,967 INFO L225 Difference]: With dead ends: 170 [2019-08-05 11:04:55,967 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 11:04:55,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:04:55,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 11:04:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 61. [2019-08-05 11:04:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:04:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-08-05 11:04:55,973 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 40 [2019-08-05 11:04:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:55,973 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-08-05 11:04:55,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-08-05 11:04:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:04:55,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:55,974 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2019-08-05 11:04:55,974 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:55,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 81 times [2019-08-05 11:04:55,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:55,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:04:56,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:56,137 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_96|], 1=[|v_#valid_97|]} [2019-08-05 11:04:56,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:56,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:56,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:56,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:56,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:56,153 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:56,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:56,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:56,162 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:56,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:56,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:04:56,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:04:56,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:04:56,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:04:56,512 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 24 states. [2019-08-05 11:04:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:57,498 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-08-05 11:04:57,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:04:57,498 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:04:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:57,499 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:04:57,499 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:04:57,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:04:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:04:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 63. [2019-08-05 11:04:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:04:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-08-05 11:04:57,501 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 42 [2019-08-05 11:04:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:57,502 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-08-05 11:04:57,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:04:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-08-05 11:04:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:04:57,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:57,502 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 9, 8, 1, 1, 1, 1] [2019-08-05 11:04:57,503 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:57,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:57,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1548521311, now seen corresponding path program 82 times [2019-08-05 11:04:57,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:57,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:04:57,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:57,613 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_97|], 1=[|v_#valid_98|]} [2019-08-05 11:04:57,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:57,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:57,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:57,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:57,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:57,629 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:57,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:57,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:57,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:57,936 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 11:04:57,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:57,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:04:57,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:04:57,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:04:57,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:04:57,937 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 24 states. [2019-08-05 11:04:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:58,903 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2019-08-05 11:04:58,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:04:58,903 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:04:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:58,904 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:04:58,905 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:04:58,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=976, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:04:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:04:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 63. [2019-08-05 11:04:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:04:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-08-05 11:04:58,907 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 42 [2019-08-05 11:04:58,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:58,908 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-08-05 11:04:58,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:04:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-08-05 11:04:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:04:58,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:58,908 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 7, 1, 1, 1, 1] [2019-08-05 11:04:58,908 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash 277502175, now seen corresponding path program 83 times [2019-08-05 11:04:58,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:58,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:04:58,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:58,996 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_98|], 1=[|v_#valid_99|]} [2019-08-05 11:04:58,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:58,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:58,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:59,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:59,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:04:59,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:59,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:59,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:59,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:04:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:59,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:59,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:04:59,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:04:59,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:04:59,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:04:59,419 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 24 states. [2019-08-05 11:05:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:00,455 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-08-05 11:05:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:05:00,456 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:05:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:00,457 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:05:00,457 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:05:00,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:05:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:05:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 63. [2019-08-05 11:05:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:05:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-08-05 11:05:00,460 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 42 [2019-08-05 11:05:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:00,460 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-08-05 11:05:00,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:05:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-08-05 11:05:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:05:00,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:00,461 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 6, 1, 1, 1, 1] [2019-08-05 11:05:00,461 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:00,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1152156255, now seen corresponding path program 84 times [2019-08-05 11:05:00,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:00,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:05:00,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:00,557 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_99|], 1=[|v_#valid_100|]} [2019-08-05 11:05:00,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:00,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:00,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:00,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:00,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:00,577 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:00,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:00,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:00,588 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:00,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:00,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:05:00,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:05:00,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:05:00,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:00,854 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 24 states. [2019-08-05 11:05:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:01,845 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2019-08-05 11:05:01,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:05:01,846 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:05:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:01,846 INFO L225 Difference]: With dead ends: 138 [2019-08-05 11:05:01,846 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 11:05:01,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:05:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 11:05:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 63. [2019-08-05 11:05:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:05:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-08-05 11:05:01,849 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 42 [2019-08-05 11:05:01,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:01,850 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-08-05 11:05:01,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:05:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-08-05 11:05:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:05:01,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:01,850 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 6, 5, 1, 1, 1, 1] [2019-08-05 11:05:01,850 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1716194271, now seen corresponding path program 85 times [2019-08-05 11:05:01,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:01,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:05:01,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:01,992 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_100|], 1=[|v_#valid_101|]} [2019-08-05 11:05:01,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:01,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:01,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:02,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:02,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:02,010 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:02,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:02,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:02,020 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:02,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:02,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:05:02,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:05:02,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:05:02,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:02,295 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 24 states. [2019-08-05 11:05:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:03,202 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2019-08-05 11:05:03,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:05:03,203 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:05:03,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:03,204 INFO L225 Difference]: With dead ends: 152 [2019-08-05 11:05:03,204 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 11:05:03,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:05:03,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 11:05:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 63. [2019-08-05 11:05:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:05:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-08-05 11:05:03,207 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 42 [2019-08-05 11:05:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:03,207 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-08-05 11:05:03,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:05:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-08-05 11:05:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:05:03,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:03,208 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 5, 4, 1, 1, 1, 1] [2019-08-05 11:05:03,208 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:03,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1761473887, now seen corresponding path program 86 times [2019-08-05 11:05:03,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:03,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:05:03,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:03,342 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_101|], 1=[|v_#valid_102|]} [2019-08-05 11:05:03,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:03,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:03,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:03,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:03,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:03,364 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:03,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:03,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:03,374 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:03,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:03,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:05:03,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:05:03,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:05:03,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:03,590 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 24 states. [2019-08-05 11:05:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:04,593 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2019-08-05 11:05:04,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:05:04,593 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:05:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:04,594 INFO L225 Difference]: With dead ends: 164 [2019-08-05 11:05:04,594 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 11:05:04,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:05:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 11:05:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 63. [2019-08-05 11:05:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:05:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-08-05 11:05:04,596 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 42 [2019-08-05 11:05:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:04,597 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-08-05 11:05:04,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:05:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-08-05 11:05:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:05:04,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:04,597 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 4, 3, 1, 1, 1, 1] [2019-08-05 11:05:04,598 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:04,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1180516063, now seen corresponding path program 87 times [2019-08-05 11:05:04,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:04,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:05:04,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:04,795 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_102|], 1=[|v_#valid_103|]} [2019-08-05 11:05:04,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:04,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:04,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:04,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:04,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:04,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:04,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:04,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:04,823 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:05,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:05,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:05:05,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:05:05,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:05:05,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:05,015 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 24 states. [2019-08-05 11:05:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:05,910 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2019-08-05 11:05:05,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:05:05,910 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:05:05,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:05,911 INFO L225 Difference]: With dead ends: 174 [2019-08-05 11:05:05,911 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 11:05:05,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:05:05,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 11:05:05,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 63. [2019-08-05 11:05:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:05:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-08-05 11:05:05,913 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 42 [2019-08-05 11:05:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:05,913 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-08-05 11:05:05,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:05:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-08-05 11:05:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:05:05,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:05,914 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 3, 2, 1, 1, 1, 1] [2019-08-05 11:05:05,914 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:05,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2113988703, now seen corresponding path program 88 times [2019-08-05 11:05:05,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:05,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:05:05,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:06,061 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_103|], 1=[|v_#valid_104|]} [2019-08-05 11:05:06,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:06,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:06,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:06,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:06,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:06,078 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:06,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:06,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:06,088 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:06,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:06,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:05:06,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:05:06,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:05:06,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:06,272 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 24 states. [2019-08-05 11:05:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:07,276 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2019-08-05 11:05:07,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:05:07,276 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:05:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:07,277 INFO L225 Difference]: With dead ends: 182 [2019-08-05 11:05:07,277 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 11:05:07,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:05:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 11:05:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 63. [2019-08-05 11:05:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:05:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-08-05 11:05:07,280 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 42 [2019-08-05 11:05:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:07,280 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-08-05 11:05:07,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:05:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-08-05 11:05:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:05:07,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:07,282 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 2, 1, 1, 1, 1, 1] [2019-08-05 11:05:07,282 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:07,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:07,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1786711585, now seen corresponding path program 89 times [2019-08-05 11:05:07,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:07,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:05:07,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:07,519 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_104|], 1=[|v_#valid_105|]} [2019-08-05 11:05:07,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:07,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:07,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:07,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:07,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:07,536 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:07,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:07,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:07,545 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:07,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:07,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:05:07,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:05:07,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:05:07,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:05:07,642 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 23 states. [2019-08-05 11:05:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:08,521 INFO L93 Difference]: Finished difference Result 188 states and 198 transitions. [2019-08-05 11:05:08,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:05:08,521 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-08-05 11:05:08,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:08,522 INFO L225 Difference]: With dead ends: 188 [2019-08-05 11:05:08,522 INFO L226 Difference]: Without dead ends: 188 [2019-08-05 11:05:08,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-05 11:05:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 63. [2019-08-05 11:05:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:05:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-08-05 11:05:08,524 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 42 [2019-08-05 11:05:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:08,525 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-08-05 11:05:08,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:05:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-08-05 11:05:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:05:08,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:08,526 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2019-08-05 11:05:08,526 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:08,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:08,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1737139361, now seen corresponding path program 18 times [2019-08-05 11:05:08,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:08,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:05:08,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:08,700 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_105|], 1=[|v_#valid_106|]} [2019-08-05 11:05:08,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:08,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:08,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:08,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:08,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:08,717 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:08,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:08,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:08,726 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:08,789 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 11:05:08,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:08,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:05:08,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:05:08,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:05:08,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:05:08,791 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 23 states. [2019-08-05 11:05:09,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:09,639 INFO L93 Difference]: Finished difference Result 196 states and 207 transitions. [2019-08-05 11:05:09,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:05:09,640 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-08-05 11:05:09,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:09,640 INFO L225 Difference]: With dead ends: 196 [2019-08-05 11:05:09,641 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 11:05:09,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 11:05:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 65. [2019-08-05 11:05:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:05:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-08-05 11:05:09,643 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 42 [2019-08-05 11:05:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:09,643 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-08-05 11:05:09,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:05:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-08-05 11:05:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:09,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:09,644 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2019-08-05 11:05:09,644 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:09,644 INFO L82 PathProgramCache]: Analyzing trace with hash 371848857, now seen corresponding path program 90 times [2019-08-05 11:05:09,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:09,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:05:09,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:09,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:09,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:05:09,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:05:09,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:05:09,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:05:09,992 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 23 states. [2019-08-05 11:05:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:10,121 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-08-05 11:05:10,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:05:10,122 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-08-05 11:05:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:10,122 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:05:10,122 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:05:10,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:05:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:05:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:05:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:05:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-08-05 11:05:10,124 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 44 [2019-08-05 11:05:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:10,124 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-08-05 11:05:10,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:05:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-08-05 11:05:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:10,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:10,125 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2019-08-05 11:05:10,125 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:10,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:10,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2070347801, now seen corresponding path program 91 times [2019-08-05 11:05:10,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:10,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:05:10,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:10,461 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_106|], 1=[|v_#valid_107|]} [2019-08-05 11:05:10,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:10,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:10,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:10,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:10,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:10,479 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:10,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:10,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:10,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:10,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:10,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:10,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:10,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:10,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:10,835 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 25 states. [2019-08-05 11:05:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:11,894 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2019-08-05 11:05:11,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:11,894 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:05:11,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:11,895 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:05:11,895 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:05:11,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=249, Invalid=1083, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:05:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:05:11,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 65. [2019-08-05 11:05:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:05:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:05:11,899 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 44 [2019-08-05 11:05:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:11,899 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:05:11,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:05:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:11,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:11,900 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 8, 1, 1, 1, 1] [2019-08-05 11:05:11,900 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:11,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:11,901 INFO L82 PathProgramCache]: Analyzing trace with hash 391670169, now seen corresponding path program 92 times [2019-08-05 11:05:11,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:11,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:05:11,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:11,995 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_107|], 1=[|v_#valid_108|]} [2019-08-05 11:05:11,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:11,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:11,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:12,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:12,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:12,013 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:12,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:12,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:12,022 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:12,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:12,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:12,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:12,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:12,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:12,361 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 25 states. [2019-08-05 11:05:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:13,411 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2019-08-05 11:05:13,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:13,411 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:05:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:13,412 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:05:13,412 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:05:13,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:05:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:05:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 65. [2019-08-05 11:05:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:05:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:05:13,414 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 44 [2019-08-05 11:05:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:13,415 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:05:13,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:05:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:13,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:13,416 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 7, 1, 1, 1, 1] [2019-08-05 11:05:13,416 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:13,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:13,416 INFO L82 PathProgramCache]: Analyzing trace with hash -879348967, now seen corresponding path program 93 times [2019-08-05 11:05:13,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:13,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:05:13,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:13,594 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_108|], 1=[|v_#valid_109|]} [2019-08-05 11:05:13,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:13,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:13,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:13,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:13,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:13,614 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:13,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:13,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:13,624 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:14,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:14,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:14,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:14,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:14,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:14,342 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 25 states. [2019-08-05 11:05:15,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:15,467 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2019-08-05 11:05:15,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:15,468 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:05:15,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:15,468 INFO L225 Difference]: With dead ends: 124 [2019-08-05 11:05:15,469 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 11:05:15,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:05:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 11:05:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 65. [2019-08-05 11:05:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:05:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:05:15,474 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 44 [2019-08-05 11:05:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:15,474 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:05:15,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:05:15,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:15,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:15,475 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 7, 6, 1, 1, 1, 1] [2019-08-05 11:05:15,477 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:15,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:15,477 INFO L82 PathProgramCache]: Analyzing trace with hash -4694887, now seen corresponding path program 94 times [2019-08-05 11:05:15,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:15,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:05:15,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:15,643 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_109|], 1=[|v_#valid_110|]} [2019-08-05 11:05:15,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:15,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:15,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:15,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:15,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:15,661 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:15,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:15,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:15,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:15,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:15,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:15,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:15,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:15,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:15,964 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 25 states. [2019-08-05 11:05:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:16,971 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-08-05 11:05:16,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:16,972 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:05:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:16,973 INFO L225 Difference]: With dead ends: 140 [2019-08-05 11:05:16,973 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 11:05:16,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:05:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 11:05:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 65. [2019-08-05 11:05:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:05:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:05:16,975 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 44 [2019-08-05 11:05:16,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:16,975 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:05:16,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:05:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:16,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:16,976 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 6, 5, 1, 1, 1, 1] [2019-08-05 11:05:16,977 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:16,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:16,977 INFO L82 PathProgramCache]: Analyzing trace with hash 559343129, now seen corresponding path program 95 times [2019-08-05 11:05:16,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:16,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:05:16,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:17,097 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_110|], 1=[|v_#valid_111|]} [2019-08-05 11:05:17,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:17,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:17,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:17,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:17,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:17,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:17,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:17,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:17,125 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:17,363 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 11:05:17,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:17,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:17,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:17,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:17,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:17,364 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 25 states. [2019-08-05 11:05:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:18,360 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2019-08-05 11:05:18,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:18,361 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:05:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:18,362 INFO L225 Difference]: With dead ends: 154 [2019-08-05 11:05:18,362 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 11:05:18,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:05:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 11:05:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 65. [2019-08-05 11:05:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:05:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:05:18,364 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 44 [2019-08-05 11:05:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:18,365 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:05:18,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:05:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:18,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:18,365 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 5, 4, 1, 1, 1, 1] [2019-08-05 11:05:18,365 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash 604622745, now seen corresponding path program 96 times [2019-08-05 11:05:18,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:18,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:05:18,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:18,542 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_111|], 1=[|v_#valid_112|]} [2019-08-05 11:05:18,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:18,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:18,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:18,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:18,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:18,560 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:18,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:18,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:18,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:18,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:18,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:18,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:18,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:18,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:18,792 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 25 states. [2019-08-05 11:05:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:19,951 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2019-08-05 11:05:19,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:19,951 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:05:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:19,952 INFO L225 Difference]: With dead ends: 166 [2019-08-05 11:05:19,952 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 11:05:19,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:05:19,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 11:05:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 65. [2019-08-05 11:05:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:05:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:05:19,954 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 44 [2019-08-05 11:05:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:19,954 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:05:19,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:05:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:19,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:19,955 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 4, 3, 1, 1, 1, 1] [2019-08-05 11:05:19,955 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash 23664921, now seen corresponding path program 97 times [2019-08-05 11:05:19,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:19,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:05:19,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:20,254 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_112|], 1=[|v_#valid_113|]} [2019-08-05 11:05:20,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:20,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:20,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:20,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:20,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:20,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:20,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:20,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:20,281 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:20,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:20,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:20,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:20,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:20,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:20,483 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 25 states. [2019-08-05 11:05:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:21,472 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2019-08-05 11:05:21,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:21,473 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:05:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:21,473 INFO L225 Difference]: With dead ends: 176 [2019-08-05 11:05:21,474 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 11:05:21,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:05:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 11:05:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 65. [2019-08-05 11:05:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:05:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:05:21,476 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 44 [2019-08-05 11:05:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:21,477 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:05:21,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:05:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:21,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:21,478 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 3, 2, 1, 1, 1, 1] [2019-08-05 11:05:21,478 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash 957137561, now seen corresponding path program 98 times [2019-08-05 11:05:21,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:21,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:05:21,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:21,636 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_113|], 1=[|v_#valid_114|]} [2019-08-05 11:05:21,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:21,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:21,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:21,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:21,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:21,652 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:21,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:21,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:21,661 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:21,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:21,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:21,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:21,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:21,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:21,847 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 25 states. [2019-08-05 11:05:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:22,880 INFO L93 Difference]: Finished difference Result 184 states and 194 transitions. [2019-08-05 11:05:22,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:22,881 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:05:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:22,882 INFO L225 Difference]: With dead ends: 184 [2019-08-05 11:05:22,882 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 11:05:22,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:05:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 11:05:22,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 65. [2019-08-05 11:05:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:05:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:05:22,885 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 44 [2019-08-05 11:05:22,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:22,885 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:05:22,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:05:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:22,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:22,886 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 2, 1, 1, 1, 1, 1] [2019-08-05 11:05:22,886 INFO L418 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:22,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:22,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1351404569, now seen corresponding path program 99 times [2019-08-05 11:05:22,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:22,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:05:22,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:23,081 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_114|], 1=[|v_#valid_115|]} [2019-08-05 11:05:23,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:23,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:23,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:23,282 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:05:23,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:23,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:23,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:23,467 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:05:23,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:23,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:23,468 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:23,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:23,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:05:23,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:05:23,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:05:23,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:23,593 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 24 states. [2019-08-05 11:05:24,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:24,534 INFO L93 Difference]: Finished difference Result 190 states and 200 transitions. [2019-08-05 11:05:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:24,534 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-08-05 11:05:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:24,535 INFO L225 Difference]: With dead ends: 190 [2019-08-05 11:05:24,535 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 11:05:24,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:05:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 11:05:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 65. [2019-08-05 11:05:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:05:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:05:24,540 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 44 [2019-08-05 11:05:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:24,540 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:05:24,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:05:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:05:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:24,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:24,541 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2019-08-05 11:05:24,541 INFO L418 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:24,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:24,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1400976793, now seen corresponding path program 19 times [2019-08-05 11:05:24,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:24,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:05:24,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:24,732 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_115|], 1=[|v_#valid_116|]} [2019-08-05 11:05:24,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:24,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:24,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:24,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:24,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:24,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:24,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:24,759 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:24,826 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 11:05:24,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:24,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:05:24,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:05:24,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:05:24,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:24,827 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 24 states. [2019-08-05 11:05:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:25,835 INFO L93 Difference]: Finished difference Result 198 states and 209 transitions. [2019-08-05 11:05:25,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:05:25,836 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-08-05 11:05:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:25,837 INFO L225 Difference]: With dead ends: 198 [2019-08-05 11:05:25,837 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 11:05:25,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 11:05:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 67. [2019-08-05 11:05:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:05:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2019-08-05 11:05:25,839 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 44 [2019-08-05 11:05:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:25,840 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2019-08-05 11:05:25,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:05:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2019-08-05 11:05:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:25,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:25,840 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2019-08-05 11:05:25,841 INFO L418 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:25,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 100 times [2019-08-05 11:05:25,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:25,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:05:25,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:25,964 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_116|], 1=[|v_#valid_117|]} [2019-08-05 11:05:25,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:25,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:25,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:25,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:25,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:25,982 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:25,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:25,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:25,992 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:26,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:26,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:26,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:26,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:26,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:26,393 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 26 states. [2019-08-05 11:05:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:27,496 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2019-08-05 11:05:27,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:27,496 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:05:27,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:27,497 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:05:27,497 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:05:27,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=287, Invalid=1195, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:05:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:05:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 69. [2019-08-05 11:05:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:05:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:05:27,499 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 46 [2019-08-05 11:05:27,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:27,500 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:05:27,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:05:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:27,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:27,500 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 10, 9, 1, 1, 1, 1] [2019-08-05 11:05:27,501 INFO L418 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:27,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1562037293, now seen corresponding path program 101 times [2019-08-05 11:05:27,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:27,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:05:27,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:27,600 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_118|]} [2019-08-05 11:05:27,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:27,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:27,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:27,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:27,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:27,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:27,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:27,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:27,632 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:27,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:27,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:27,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:27,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:27,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:27,998 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 26 states. [2019-08-05 11:05:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:29,159 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2019-08-05 11:05:29,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:29,159 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:05:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:29,160 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:05:29,160 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:05:29,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:05:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:05:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 69. [2019-08-05 11:05:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:05:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:05:29,162 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 46 [2019-08-05 11:05:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:29,163 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:05:29,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:05:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:29,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:29,164 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 8, 1, 1, 1, 1] [2019-08-05 11:05:29,164 INFO L418 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1054252371, now seen corresponding path program 102 times [2019-08-05 11:05:29,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:29,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:05:29,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:29,295 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_118|], 1=[|v_#valid_119|]} [2019-08-05 11:05:29,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:29,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:29,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:29,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:29,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:29,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:29,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:29,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:29,320 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:29,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:29,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:29,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:29,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:29,652 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 26 states. [2019-08-05 11:05:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:30,878 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2019-08-05 11:05:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:30,879 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:05:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:30,879 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:05:30,880 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 11:05:30,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=218, Invalid=1114, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:05:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 11:05:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 69. [2019-08-05 11:05:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:05:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:05:30,882 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 46 [2019-08-05 11:05:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:30,882 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:05:30,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:05:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:30,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:30,883 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 8, 7, 1, 1, 1, 1] [2019-08-05 11:05:30,883 INFO L418 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash -216766765, now seen corresponding path program 103 times [2019-08-05 11:05:30,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:30,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:05:30,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:31,013 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_119|], 1=[|v_#valid_120|]} [2019-08-05 11:05:31,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:31,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:31,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:31,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:31,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:31,033 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:31,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:31,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:31,041 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:31,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:31,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:31,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:31,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:31,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:31,353 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 26 states. [2019-08-05 11:05:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:32,482 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2019-08-05 11:05:32,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:32,483 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:05:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:32,483 INFO L225 Difference]: With dead ends: 152 [2019-08-05 11:05:32,483 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 11:05:32,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=188, Invalid=1072, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:05:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 11:05:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 69. [2019-08-05 11:05:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:05:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:05:32,486 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 46 [2019-08-05 11:05:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:32,486 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:05:32,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:05:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:32,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:32,487 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 7, 6, 1, 1, 1, 1] [2019-08-05 11:05:32,487 INFO L418 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash 657887315, now seen corresponding path program 104 times [2019-08-05 11:05:32,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:32,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:05:32,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:32,624 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_120|], 1=[|v_#valid_121|]} [2019-08-05 11:05:32,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:32,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:32,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:32,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:32,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:32,642 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:32,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:32,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:32,652 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:32,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:32,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:32,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:32,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:32,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:32,953 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 26 states. [2019-08-05 11:05:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:34,000 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2019-08-05 11:05:34,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:34,001 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:05:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:34,002 INFO L225 Difference]: With dead ends: 168 [2019-08-05 11:05:34,002 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 11:05:34,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:05:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 11:05:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 69. [2019-08-05 11:05:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:05:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:05:34,004 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 46 [2019-08-05 11:05:34,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:34,004 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:05:34,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:05:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:34,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:34,005 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 6, 5, 1, 1, 1, 1] [2019-08-05 11:05:34,005 INFO L418 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1221925331, now seen corresponding path program 105 times [2019-08-05 11:05:34,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:34,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:05:34,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:34,259 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_121|], 1=[|v_#valid_122|]} [2019-08-05 11:05:34,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:34,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:34,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:34,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:34,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:34,284 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:34,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:34,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:34,293 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:34,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:34,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:34,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:34,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:34,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:34,561 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 26 states. [2019-08-05 11:05:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:35,720 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2019-08-05 11:05:35,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:35,721 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:05:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:35,721 INFO L225 Difference]: With dead ends: 182 [2019-08-05 11:05:35,722 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 11:05:35,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:05:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 11:05:35,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 69. [2019-08-05 11:05:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:05:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:05:35,725 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 46 [2019-08-05 11:05:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:35,725 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:05:35,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:05:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:35,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:35,726 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 5, 4, 1, 1, 1, 1] [2019-08-05 11:05:35,726 INFO L418 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:35,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1267204947, now seen corresponding path program 106 times [2019-08-05 11:05:35,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:35,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:05:35,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:36,607 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_122|], 1=[|v_#valid_123|]} [2019-08-05 11:05:36,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:36,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:36,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:36,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:36,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:36,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:36,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:36,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:36,633 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:36,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:36,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:36,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:36,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:36,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:36,866 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 26 states. [2019-08-05 11:05:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:37,970 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2019-08-05 11:05:37,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:37,971 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:05:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:37,971 INFO L225 Difference]: With dead ends: 194 [2019-08-05 11:05:37,972 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 11:05:37,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:05:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 11:05:37,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 69. [2019-08-05 11:05:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:05:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:05:37,974 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 46 [2019-08-05 11:05:37,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:37,974 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:05:37,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:05:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:37,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:37,975 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 4, 3, 1, 1, 1, 1] [2019-08-05 11:05:37,976 INFO L418 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:37,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:37,977 INFO L82 PathProgramCache]: Analyzing trace with hash 686247123, now seen corresponding path program 107 times [2019-08-05 11:05:37,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:37,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:05:37,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:38,214 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_123|], 1=[|v_#valid_124|]} [2019-08-05 11:05:38,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:38,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:38,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:38,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:38,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 318 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:38,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:38,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:38,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:38,442 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 26 states. [2019-08-05 11:05:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:39,518 INFO L93 Difference]: Finished difference Result 204 states and 215 transitions. [2019-08-05 11:05:39,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:39,518 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:05:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:39,519 INFO L225 Difference]: With dead ends: 204 [2019-08-05 11:05:39,519 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 11:05:39,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:05:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 11:05:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 69. [2019-08-05 11:05:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:05:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:05:39,522 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 46 [2019-08-05 11:05:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:39,522 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:05:39,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:05:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:39,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:39,523 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 3, 2, 1, 1, 1, 1] [2019-08-05 11:05:39,523 INFO L418 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:39,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:39,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1619719763, now seen corresponding path program 108 times [2019-08-05 11:05:39,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:39,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:05:39,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:39,696 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_124|], 1=[|v_#valid_125|]} [2019-08-05 11:05:39,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:39,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:39,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:39,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:39,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:39,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:39,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:39,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:39,722 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 348 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:39,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:39,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:39,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:39,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:39,905 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 26 states. [2019-08-05 11:05:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:41,119 INFO L93 Difference]: Finished difference Result 212 states and 223 transitions. [2019-08-05 11:05:41,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:41,120 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:05:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:41,120 INFO L225 Difference]: With dead ends: 212 [2019-08-05 11:05:41,120 INFO L226 Difference]: Without dead ends: 212 [2019-08-05 11:05:41,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:05:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-05 11:05:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 69. [2019-08-05 11:05:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:05:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:05:41,123 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 46 [2019-08-05 11:05:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:41,123 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:05:41,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:05:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:41,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:41,124 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 2, 1, 1, 1, 1, 1] [2019-08-05 11:05:41,124 INFO L418 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:41,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:41,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2013986771, now seen corresponding path program 109 times [2019-08-05 11:05:41,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:41,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:05:41,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:41,336 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_125|], 1=[|v_#valid_126|]} [2019-08-05 11:05:41,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:41,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:41,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:41,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:41,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:41,353 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:41,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:41,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:41,361 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 382 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:41,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:41,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:41,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:41,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:41,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:41,460 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 25 states. [2019-08-05 11:05:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:42,494 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2019-08-05 11:05:42,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:42,494 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-08-05 11:05:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:42,495 INFO L225 Difference]: With dead ends: 218 [2019-08-05 11:05:42,495 INFO L226 Difference]: Without dead ends: 218 [2019-08-05 11:05:42,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:05:42,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-08-05 11:05:42,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 69. [2019-08-05 11:05:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:05:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:05:42,497 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 46 [2019-08-05 11:05:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:42,498 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:05:42,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:05:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:42,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:42,498 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2019-08-05 11:05:42,499 INFO L418 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2063558995, now seen corresponding path program 20 times [2019-08-05 11:05:42,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:42,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:05:42,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:42,696 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_126|], 1=[|v_#valid_127|]} [2019-08-05 11:05:42,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:42,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:42,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:42,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:42,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:42,711 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:42,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:42,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:42,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:42,789 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 11:05:42,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:42,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:42,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:42,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:42,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:42,791 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 25 states. [2019-08-05 11:05:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:43,760 INFO L93 Difference]: Finished difference Result 226 states and 238 transitions. [2019-08-05 11:05:43,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:43,761 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-08-05 11:05:43,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:43,762 INFO L225 Difference]: With dead ends: 226 [2019-08-05 11:05:43,762 INFO L226 Difference]: Without dead ends: 226 [2019-08-05 11:05:43,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-08-05 11:05:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 71. [2019-08-05 11:05:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:05:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2019-08-05 11:05:43,763 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 46 [2019-08-05 11:05:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:43,763 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2019-08-05 11:05:43,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:43,764 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2019-08-05 11:05:43,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:43,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:43,764 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 1, 1, 1, 1] [2019-08-05 11:05:43,764 INFO L418 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:43,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1950854669, now seen corresponding path program 110 times [2019-08-05 11:05:43,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:43,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:05:43,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 132 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:44,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:44,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:44,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:44,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:44,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:44,024 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand 25 states. [2019-08-05 11:05:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:44,171 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2019-08-05 11:05:44,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:44,171 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-08-05 11:05:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:44,172 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:05:44,172 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:05:44,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:05:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:05:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:05:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:05:44,174 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 48 [2019-08-05 11:05:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:44,174 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:05:44,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:05:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:44,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:44,175 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 1, 1, 1, 1] [2019-08-05 11:05:44,175 INFO L418 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:44,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:44,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2120767373, now seen corresponding path program 111 times [2019-08-05 11:05:44,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:44,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:05:44,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:44,273 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_127|], 1=[|v_#valid_128|]} [2019-08-05 11:05:44,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:44,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:44,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:44,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:44,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:44,306 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:44,447 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:05:44,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:44,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:44,448 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:44,878 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:05:45,338 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:05:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:45,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:45,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:05:45,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:05:45,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:05:45,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:45,860 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 27 states. [2019-08-05 11:05:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:47,004 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-08-05 11:05:47,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:47,005 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:05:47,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:47,005 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:05:47,005 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:05:47,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=289, Invalid=1271, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:05:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:05:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2019-08-05 11:05:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:05:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-08-05 11:05:47,007 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 48 [2019-08-05 11:05:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:47,008 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-08-05 11:05:47,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:05:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-08-05 11:05:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:47,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:47,009 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 9, 1, 1, 1, 1] [2019-08-05 11:05:47,009 INFO L418 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:47,009 INFO L82 PathProgramCache]: Analyzing trace with hash -475700979, now seen corresponding path program 112 times [2019-08-05 11:05:47,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:47,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:05:47,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:47,535 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_128|], 1=[|v_#valid_129|]} [2019-08-05 11:05:47,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:47,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:47,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:47,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:47,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:47,552 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:47,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:47,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:47,562 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:47,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:47,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:05:47,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:05:47,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:05:47,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:47,938 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 27 states. [2019-08-05 11:05:49,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:49,168 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2019-08-05 11:05:49,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:49,169 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:05:49,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:49,169 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:05:49,169 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:05:49,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=253, Invalid=1229, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:05:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:05:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 71. [2019-08-05 11:05:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:05:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-08-05 11:05:49,172 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 48 [2019-08-05 11:05:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:49,172 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-08-05 11:05:49,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:05:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-08-05 11:05:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:49,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:49,173 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 8, 1, 1, 1, 1] [2019-08-05 11:05:49,173 INFO L418 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:49,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:49,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2140588685, now seen corresponding path program 113 times [2019-08-05 11:05:49,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:49,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:05:49,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:49,284 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_129|], 1=[|v_#valid_130|]} [2019-08-05 11:05:49,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:49,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:49,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:49,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:49,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:49,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:49,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:49,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:49,310 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:49,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:49,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:05:49,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:05:49,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:05:49,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:49,742 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 27 states. [2019-08-05 11:05:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:51,068 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2019-08-05 11:05:51,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:51,069 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:05:51,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:51,070 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:05:51,070 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:05:51,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:05:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:05:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 71. [2019-08-05 11:05:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:05:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-08-05 11:05:51,072 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 48 [2019-08-05 11:05:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:51,072 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-08-05 11:05:51,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:05:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-08-05 11:05:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:51,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:51,073 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 8, 7, 1, 1, 1, 1] [2019-08-05 11:05:51,073 INFO L418 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:51,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:51,073 INFO L82 PathProgramCache]: Analyzing trace with hash 869569549, now seen corresponding path program 114 times [2019-08-05 11:05:51,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:51,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:05:51,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:51,194 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_130|], 1=[|v_#valid_131|]} [2019-08-05 11:05:51,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:51,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:51,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:51,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:51,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:51,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:51,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:51,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:51,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:51,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:05:51,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:05:51,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:05:51,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:51,549 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 27 states. [2019-08-05 11:05:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:52,804 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2019-08-05 11:05:52,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:52,804 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:05:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:52,805 INFO L225 Difference]: With dead ends: 154 [2019-08-05 11:05:52,805 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 11:05:52,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=1142, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:05:52,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 11:05:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 71. [2019-08-05 11:05:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:05:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-08-05 11:05:52,807 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 48 [2019-08-05 11:05:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:52,807 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-08-05 11:05:52,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:05:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-08-05 11:05:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:52,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:52,808 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 7, 6, 1, 1, 1, 1] [2019-08-05 11:05:52,808 INFO L418 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:52,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1744223629, now seen corresponding path program 115 times [2019-08-05 11:05:52,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:52,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:05:52,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:52,977 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_131|], 1=[|v_#valid_132|]} [2019-08-05 11:05:52,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:52,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:52,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:52,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:52,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:52,994 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:53,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:53,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:53,003 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:53,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:53,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:05:53,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:05:53,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:05:53,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:53,297 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 27 states. [2019-08-05 11:05:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:54,476 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2019-08-05 11:05:54,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:54,477 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:05:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:54,478 INFO L225 Difference]: With dead ends: 170 [2019-08-05 11:05:54,478 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 11:05:54,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:05:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 11:05:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 71. [2019-08-05 11:05:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:05:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-08-05 11:05:54,480 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 48 [2019-08-05 11:05:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:54,480 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-08-05 11:05:54,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:05:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-08-05 11:05:54,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:54,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:54,481 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 6, 5, 1, 1, 1, 1] [2019-08-05 11:05:54,481 INFO L418 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:54,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1986705651, now seen corresponding path program 116 times [2019-08-05 11:05:54,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:54,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:05:54,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:54,628 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_132|], 1=[|v_#valid_133|]} [2019-08-05 11:05:54,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:54,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:54,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:54,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:54,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:54,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:54,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:54,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:54,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:54,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:54,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:05:54,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:05:54,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:05:54,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:54,922 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 27 states. [2019-08-05 11:05:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:56,343 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2019-08-05 11:05:56,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:56,344 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:05:56,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:56,345 INFO L225 Difference]: With dead ends: 184 [2019-08-05 11:05:56,345 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 11:05:56,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:05:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 11:05:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 71. [2019-08-05 11:05:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:05:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-08-05 11:05:56,347 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 48 [2019-08-05 11:05:56,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:56,348 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-08-05 11:05:56,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:05:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-08-05 11:05:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:56,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:56,349 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 5, 4, 1, 1, 1, 1] [2019-08-05 11:05:56,349 INFO L418 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:56,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1941426035, now seen corresponding path program 117 times [2019-08-05 11:05:56,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:56,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:05:56,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:56,616 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_133|], 1=[|v_#valid_134|]} [2019-08-05 11:05:56,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:56,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:56,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:56,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:56,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:56,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:56,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:56,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:56,656 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:56,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:56,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:05:56,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:05:56,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:05:56,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=644, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:56,903 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 27 states. [2019-08-05 11:05:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:58,129 INFO L93 Difference]: Finished difference Result 196 states and 207 transitions. [2019-08-05 11:05:58,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:58,129 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:05:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:58,130 INFO L225 Difference]: With dead ends: 196 [2019-08-05 11:05:58,130 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 11:05:58,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:05:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 11:05:58,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 71. [2019-08-05 11:05:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:05:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-08-05 11:05:58,133 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 48 [2019-08-05 11:05:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:58,133 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-08-05 11:05:58,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:05:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-08-05 11:05:58,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:58,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:58,134 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 4, 3, 1, 1, 1, 1] [2019-08-05 11:05:58,134 INFO L418 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:58,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:58,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1772583437, now seen corresponding path program 118 times [2019-08-05 11:05:58,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:58,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:05:58,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:58,309 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_134|], 1=[|v_#valid_135|]} [2019-08-05 11:05:58,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:58,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:58,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:58,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:58,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:05:58,361 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:58,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:58,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:58,376 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:05:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:58,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:58,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:05:58,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:05:58,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:05:58,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:58,597 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 27 states. [2019-08-05 11:05:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:59,806 INFO L93 Difference]: Finished difference Result 206 states and 217 transitions. [2019-08-05 11:05:59,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:59,806 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:05:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:59,807 INFO L225 Difference]: With dead ends: 206 [2019-08-05 11:05:59,807 INFO L226 Difference]: Without dead ends: 206 [2019-08-05 11:05:59,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:05:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-05 11:05:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 71. [2019-08-05 11:05:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:05:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-08-05 11:05:59,809 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 48 [2019-08-05 11:05:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:59,810 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-08-05 11:05:59,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:05:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-08-05 11:05:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:59,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:59,810 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 3, 2, 1, 1, 1, 1] [2019-08-05 11:05:59,811 INFO L418 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:59,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:59,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1588911219, now seen corresponding path program 119 times [2019-08-05 11:05:59,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:59,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:05:59,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:00,169 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_135|], 1=[|v_#valid_136|]} [2019-08-05 11:06:00,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:00,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:00,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:00,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:00,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:00,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:00,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:00,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:00,198 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 386 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:00,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:00,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:06:00,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:06:00,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:06:00,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:06:00,386 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 27 states. [2019-08-05 11:06:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:01,769 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2019-08-05 11:06:01,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:06:01,769 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:06:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:01,770 INFO L225 Difference]: With dead ends: 214 [2019-08-05 11:06:01,770 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 11:06:01,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:06:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 11:06:01,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 71. [2019-08-05 11:06:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:06:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-08-05 11:06:01,771 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 48 [2019-08-05 11:06:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:01,772 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-08-05 11:06:01,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:06:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-08-05 11:06:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:06:01,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:01,772 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 2, 1, 1, 1, 1, 1] [2019-08-05 11:06:01,772 INFO L418 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1194644211, now seen corresponding path program 120 times [2019-08-05 11:06:01,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:01,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:06:01,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:02,038 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_136|], 1=[|v_#valid_137|]} [2019-08-05 11:06:02,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:02,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:02,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:02,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:02,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:02,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:02,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:02,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:02,065 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:02,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:02,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:06:02,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:06:02,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:06:02,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:06:02,170 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 26 states. [2019-08-05 11:06:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:03,256 INFO L93 Difference]: Finished difference Result 220 states and 231 transitions. [2019-08-05 11:06:03,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:06:03,256 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-08-05 11:06:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:03,257 INFO L225 Difference]: With dead ends: 220 [2019-08-05 11:06:03,257 INFO L226 Difference]: Without dead ends: 220 [2019-08-05 11:06:03,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:06:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-08-05 11:06:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 71. [2019-08-05 11:06:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:06:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-08-05 11:06:03,258 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 48 [2019-08-05 11:06:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:03,259 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-08-05 11:06:03,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:06:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-08-05 11:06:03,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:06:03,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:03,259 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2019-08-05 11:06:03,259 INFO L418 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:03,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:03,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1145071987, now seen corresponding path program 21 times [2019-08-05 11:06:03,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:03,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:06:03,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:03,567 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_137|], 1=[|v_#valid_138|]} [2019-08-05 11:06:03,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:03,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:03,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:03,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:03,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:03,586 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:03,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:03,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:03,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:03,665 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 11:06:03,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:03,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:06:03,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:06:03,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:06:03,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:06:03,666 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 26 states. [2019-08-05 11:06:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:04,685 INFO L93 Difference]: Finished difference Result 228 states and 240 transitions. [2019-08-05 11:06:04,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:06:04,685 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-08-05 11:06:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:04,686 INFO L225 Difference]: With dead ends: 228 [2019-08-05 11:06:04,686 INFO L226 Difference]: Without dead ends: 228 [2019-08-05 11:06:04,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-08-05 11:06:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 73. [2019-08-05 11:06:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:06:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-08-05 11:06:04,688 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 48 [2019-08-05 11:06:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:04,688 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-08-05 11:06:04,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:06:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-08-05 11:06:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:06:04,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:04,689 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2019-08-05 11:06:04,689 INFO L418 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:04,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 121 times [2019-08-05 11:06:04,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:04,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:06:04,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:04,783 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_138|], 1=[|v_#valid_139|]} [2019-08-05 11:06:04,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:04,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:04,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:04,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:04,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:04,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:04,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:04,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:04,809 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:05,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:05,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:05,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:05,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:05,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:05,257 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 28 states. [2019-08-05 11:06:06,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:06,764 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2019-08-05 11:06:06,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:06:06,765 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:06:06,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:06,765 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:06:06,765 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:06:06,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=330, Invalid=1392, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:06:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:06:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 75. [2019-08-05 11:06:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 11:06:06,768 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 50 [2019-08-05 11:06:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:06,768 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 11:06:06,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 11:06:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:06:06,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:06,769 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 11, 10, 1, 1, 1, 1] [2019-08-05 11:06:06,769 INFO L418 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1882055097, now seen corresponding path program 122 times [2019-08-05 11:06:06,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:06,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:06:06,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:06,910 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_139|], 1=[|v_#valid_140|]} [2019-08-05 11:06:06,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:06,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:06,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:06,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:06,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:06,928 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:06,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:06,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:06,938 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:07,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:07,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:07,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:07,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:07,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:07,335 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 28 states. [2019-08-05 11:06:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:08,648 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2019-08-05 11:06:08,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:06:08,649 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:06:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:08,649 INFO L225 Difference]: With dead ends: 124 [2019-08-05 11:06:08,650 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 11:06:08,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=291, Invalid=1349, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:06:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 11:06:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 75. [2019-08-05 11:06:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 11:06:08,652 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 50 [2019-08-05 11:06:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:08,652 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 11:06:08,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 11:06:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:06:08,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:08,653 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 10, 9, 1, 1, 1, 1] [2019-08-05 11:06:08,653 INFO L418 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash -183556153, now seen corresponding path program 123 times [2019-08-05 11:06:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:08,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:06:08,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:08,837 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_140|], 1=[|v_#valid_141|]} [2019-08-05 11:06:08,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:08,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:08,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:08,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:08,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:08,854 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:08,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:08,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:08,864 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:09,261 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 11:06:09,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:09,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:09,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:09,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:09,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:09,262 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 28 states. [2019-08-05 11:06:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:10,445 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2019-08-05 11:06:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:06:10,446 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:06:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:10,446 INFO L225 Difference]: With dead ends: 146 [2019-08-05 11:06:10,447 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 11:06:10,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:06:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 11:06:10,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 75. [2019-08-05 11:06:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 11:06:10,449 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 50 [2019-08-05 11:06:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:10,449 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 11:06:10,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 11:06:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:06:10,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:10,449 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 9, 8, 1, 1, 1, 1] [2019-08-05 11:06:10,449 INFO L418 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:10,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1862233785, now seen corresponding path program 124 times [2019-08-05 11:06:10,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:10,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:06:10,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:10,569 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_141|], 1=[|v_#valid_142|]} [2019-08-05 11:06:10,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:10,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:10,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:10,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:10,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:10,587 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:10,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:10,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:10,594 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:11,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:11,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:11,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:11,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:11,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:11,018 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 28 states. [2019-08-05 11:06:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:12,439 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2019-08-05 11:06:12,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:06:12,440 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:06:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:12,440 INFO L225 Difference]: With dead ends: 166 [2019-08-05 11:06:12,441 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 11:06:12,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=222, Invalid=1260, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:06:12,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 11:06:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 75. [2019-08-05 11:06:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 11:06:12,443 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 50 [2019-08-05 11:06:12,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:12,444 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 11:06:12,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 11:06:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:06:12,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:12,445 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 8, 7, 1, 1, 1, 1] [2019-08-05 11:06:12,445 INFO L418 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:12,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:12,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1161714375, now seen corresponding path program 125 times [2019-08-05 11:06:12,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:12,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:06:12,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:12,600 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_142|], 1=[|v_#valid_143|]} [2019-08-05 11:06:12,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:12,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:12,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:12,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:12,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:12,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:12,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:12,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:12,629 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:12,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:12,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:12,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:12,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:12,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:12,969 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 28 states. [2019-08-05 11:06:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:14,291 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2019-08-05 11:06:14,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:06:14,292 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:06:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:14,292 INFO L225 Difference]: With dead ends: 184 [2019-08-05 11:06:14,293 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 11:06:14,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:06:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 11:06:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 75. [2019-08-05 11:06:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 11:06:14,295 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 50 [2019-08-05 11:06:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:14,295 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 11:06:14,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 11:06:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:06:14,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:14,296 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 7, 6, 1, 1, 1, 1] [2019-08-05 11:06:14,296 INFO L418 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:14,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2036368455, now seen corresponding path program 126 times [2019-08-05 11:06:14,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:14,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:06:14,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:14,442 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_143|], 1=[|v_#valid_144|]} [2019-08-05 11:06:14,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:14,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:14,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:14,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:14,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:14,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:14,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:14,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:14,468 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 314 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:14,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:14,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:14,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:14,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:14,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:14,815 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 28 states. [2019-08-05 11:06:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:16,303 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2019-08-05 11:06:16,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:06:16,304 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:06:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:16,304 INFO L225 Difference]: With dead ends: 200 [2019-08-05 11:06:16,304 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 11:06:16,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:06:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 11:06:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 75. [2019-08-05 11:06:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 11:06:16,307 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 50 [2019-08-05 11:06:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:16,307 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 11:06:16,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:16,307 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 11:06:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:06:16,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:16,308 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 6, 5, 1, 1, 1, 1] [2019-08-05 11:06:16,308 INFO L418 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1694560825, now seen corresponding path program 127 times [2019-08-05 11:06:16,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:16,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:06:16,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:16,535 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_144|], 1=[|v_#valid_145|]} [2019-08-05 11:06:16,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:16,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:16,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:16,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:16,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:16,551 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:16,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:16,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:16,560 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:16,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:16,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:16,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:16,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:16,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:16,838 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 28 states. [2019-08-05 11:06:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:18,247 INFO L93 Difference]: Finished difference Result 214 states and 226 transitions. [2019-08-05 11:06:18,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:06:18,247 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:06:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:18,248 INFO L225 Difference]: With dead ends: 214 [2019-08-05 11:06:18,248 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 11:06:18,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:06:18,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 11:06:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 75. [2019-08-05 11:06:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 11:06:18,251 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 50 [2019-08-05 11:06:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:18,251 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 11:06:18,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 11:06:18,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:06:18,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:18,252 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 5, 4, 1, 1, 1, 1] [2019-08-05 11:06:18,252 INFO L418 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:18,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1649281209, now seen corresponding path program 128 times [2019-08-05 11:06:18,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:18,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:06:18,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:18,467 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_145|], 1=[|v_#valid_146|]} [2019-08-05 11:06:18,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:18,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:18,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:18,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:18,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:18,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:18,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:18,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:18,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:18,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:18,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:18,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:18,746 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 28 states. [2019-08-05 11:06:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:20,102 INFO L93 Difference]: Finished difference Result 226 states and 238 transitions. [2019-08-05 11:06:20,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:06:20,102 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:06:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:20,103 INFO L225 Difference]: With dead ends: 226 [2019-08-05 11:06:20,103 INFO L226 Difference]: Without dead ends: 226 [2019-08-05 11:06:20,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=1070, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:06:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-08-05 11:06:20,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 75. [2019-08-05 11:06:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 11:06:20,106 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 50 [2019-08-05 11:06:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:20,107 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 11:06:20,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 11:06:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:06:20,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:20,108 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 4, 3, 1, 1, 1, 1] [2019-08-05 11:06:20,108 INFO L418 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:20,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2064728263, now seen corresponding path program 129 times [2019-08-05 11:06:20,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:20,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:06:20,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:20,371 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_146|], 1=[|v_#valid_147|]} [2019-08-05 11:06:20,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:20,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:20,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:20,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:20,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:20,389 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:20,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:20,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:20,398 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:20,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:20,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:20,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:20,611 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 28 states. [2019-08-05 11:06:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:22,022 INFO L93 Difference]: Finished difference Result 236 states and 248 transitions. [2019-08-05 11:06:22,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:06:22,023 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:06:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:22,024 INFO L225 Difference]: With dead ends: 236 [2019-08-05 11:06:22,024 INFO L226 Difference]: Without dead ends: 236 [2019-08-05 11:06:22,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:06:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-08-05 11:06:22,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 75. [2019-08-05 11:06:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 11:06:22,026 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 50 [2019-08-05 11:06:22,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:22,026 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 11:06:22,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 11:06:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:06:22,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:22,027 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 3, 2, 1, 1, 1, 1] [2019-08-05 11:06:22,027 INFO L418 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:22,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:22,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1296766393, now seen corresponding path program 130 times [2019-08-05 11:06:22,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:22,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:06:22,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:22,236 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_147|], 1=[|v_#valid_148|]} [2019-08-05 11:06:22,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:22,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:22,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:22,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:22,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:22,254 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:22,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:22,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:22,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 0 proven. 426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:22,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:22,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:22,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:22,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:22,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:22,453 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 28 states. [2019-08-05 11:06:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:23,748 INFO L93 Difference]: Finished difference Result 244 states and 256 transitions. [2019-08-05 11:06:23,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:06:23,749 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:06:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:23,749 INFO L225 Difference]: With dead ends: 244 [2019-08-05 11:06:23,750 INFO L226 Difference]: Without dead ends: 244 [2019-08-05 11:06:23,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:06:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-08-05 11:06:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 75. [2019-08-05 11:06:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 11:06:23,753 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 50 [2019-08-05 11:06:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:23,753 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 11:06:23,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 11:06:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:06:23,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:23,754 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 2, 1, 1, 1, 1, 1] [2019-08-05 11:06:23,754 INFO L418 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:23,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:23,754 INFO L82 PathProgramCache]: Analyzing trace with hash -902499385, now seen corresponding path program 131 times [2019-08-05 11:06:23,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:23,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:06:23,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:23,988 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_148|], 1=[|v_#valid_149|]} [2019-08-05 11:06:23,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:23,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:23,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:24,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:24,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:24,005 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:24,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:24,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:24,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:24,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:24,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:06:24,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:06:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:06:24,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:06:24,119 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 27 states. [2019-08-05 11:06:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:25,306 INFO L93 Difference]: Finished difference Result 250 states and 262 transitions. [2019-08-05 11:06:25,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:06:25,307 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-08-05 11:06:25,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:25,307 INFO L225 Difference]: With dead ends: 250 [2019-08-05 11:06:25,308 INFO L226 Difference]: Without dead ends: 250 [2019-08-05 11:06:25,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:06:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-08-05 11:06:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 75. [2019-08-05 11:06:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 11:06:25,310 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 50 [2019-08-05 11:06:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:25,310 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 11:06:25,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:06:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 11:06:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:06:25,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:25,311 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2019-08-05 11:06:25,311 INFO L418 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:25,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:25,312 INFO L82 PathProgramCache]: Analyzing trace with hash -852927161, now seen corresponding path program 22 times [2019-08-05 11:06:25,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:25,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:06:25,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:25,588 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_149|], 1=[|v_#valid_150|]} [2019-08-05 11:06:25,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:25,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:25,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:25,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:25,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:25,611 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:25,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:25,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:25,620 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:25,701 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 11:06:25,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:25,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:06:25,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:06:25,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:06:25,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:06:25,702 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 27 states. [2019-08-05 11:06:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:26,977 INFO L93 Difference]: Finished difference Result 258 states and 271 transitions. [2019-08-05 11:06:26,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:06:26,978 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-08-05 11:06:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:26,979 INFO L225 Difference]: With dead ends: 258 [2019-08-05 11:06:26,979 INFO L226 Difference]: Without dead ends: 258 [2019-08-05 11:06:26,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=751, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:06:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-08-05 11:06:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 77. [2019-08-05 11:06:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2019-08-05 11:06:26,981 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 50 [2019-08-05 11:06:26,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:26,982 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2019-08-05 11:06:26,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:06:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2019-08-05 11:06:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:26,982 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:26,982 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 1, 1, 1, 1] [2019-08-05 11:06:26,983 INFO L418 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:26,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:26,983 INFO L82 PathProgramCache]: Analyzing trace with hash -551015551, now seen corresponding path program 132 times [2019-08-05 11:06:26,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:27,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:06:27,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:27,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:27,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:06:27,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:06:27,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:06:27,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:06:27,244 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand 27 states. [2019-08-05 11:06:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:27,420 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2019-08-05 11:06:27,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:06:27,421 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-08-05 11:06:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:27,422 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:06:27,422 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:06:27,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:06:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:06:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:06:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-08-05 11:06:27,424 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 52 [2019-08-05 11:06:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:27,425 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-08-05 11:06:27,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:06:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-08-05 11:06:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:27,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:27,426 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 1, 1, 1, 1] [2019-08-05 11:06:27,426 INFO L418 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:27,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:27,426 INFO L82 PathProgramCache]: Analyzing trace with hash -473664255, now seen corresponding path program 133 times [2019-08-05 11:06:27,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:27,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:06:27,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:27,548 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_150|], 1=[|v_#valid_151|]} [2019-08-05 11:06:27,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:27,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:27,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:27,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:27,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:27,565 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:27,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:27,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:27,575 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:28,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:28,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:28,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:06:28,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:06:28,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:06:28,025 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 29 states. [2019-08-05 11:06:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:29,321 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2019-08-05 11:06:29,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:06:29,321 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:06:29,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:29,322 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:06:29,322 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:06:29,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=332, Invalid=1474, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:06:29,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:06:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 77. [2019-08-05 11:06:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:06:29,324 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 52 [2019-08-05 11:06:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:29,325 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:06:29,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:06:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:06:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:29,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:29,325 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 11, 10, 1, 1, 1, 1] [2019-08-05 11:06:29,326 INFO L418 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:29,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash -303751551, now seen corresponding path program 134 times [2019-08-05 11:06:29,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:29,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:06:29,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:29,440 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_151|], 1=[|v_#valid_152|]} [2019-08-05 11:06:29,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:29,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:29,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:29,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:29,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:29,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:29,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:29,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:06:29,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:06:29,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:06:29,901 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 29 states. [2019-08-05 11:06:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:31,207 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2019-08-05 11:06:31,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:06:31,207 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:06:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:31,208 INFO L225 Difference]: With dead ends: 126 [2019-08-05 11:06:31,208 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 11:06:31,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:06:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 11:06:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 77. [2019-08-05 11:06:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:06:31,210 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 52 [2019-08-05 11:06:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:31,210 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:06:31,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:06:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:06:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:31,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:31,211 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 10, 9, 1, 1, 1, 1] [2019-08-05 11:06:31,212 INFO L418 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:31,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:31,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1394747393, now seen corresponding path program 135 times [2019-08-05 11:06:31,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:31,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:06:31,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:31,553 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_152|], 1=[|v_#valid_153|]} [2019-08-05 11:06:31,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:31,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:31,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:31,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:31,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:31,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:31,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:31,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:31,593 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:32,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:32,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:32,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:06:32,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:06:32,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:06:32,135 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 29 states. [2019-08-05 11:06:33,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:33,601 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2019-08-05 11:06:33,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:06:33,602 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:06:33,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:33,602 INFO L225 Difference]: With dead ends: 148 [2019-08-05 11:06:33,603 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 11:06:33,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=257, Invalid=1383, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:06:33,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 11:06:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 77. [2019-08-05 11:06:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:06:33,606 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 52 [2019-08-05 11:06:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:33,606 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:06:33,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:06:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:06:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:33,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:33,607 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 9, 8, 1, 1, 1, 1] [2019-08-05 11:06:33,607 INFO L418 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:33,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:33,607 INFO L82 PathProgramCache]: Analyzing trace with hash -283930239, now seen corresponding path program 136 times [2019-08-05 11:06:33,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:33,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:06:33,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:33,832 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_153|], 1=[|v_#valid_154|]} [2019-08-05 11:06:33,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:33,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:33,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:33,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:33,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:33,850 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:33,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:33,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:33,858 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:34,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:34,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:34,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:06:34,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:06:34,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:06:34,471 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 29 states. [2019-08-05 11:06:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:35,824 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2019-08-05 11:06:35,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:06:35,825 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:06:35,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:35,826 INFO L225 Difference]: With dead ends: 168 [2019-08-05 11:06:35,826 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 11:06:35,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=224, Invalid=1336, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:06:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 11:06:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 77. [2019-08-05 11:06:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:06:35,828 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 52 [2019-08-05 11:06:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:35,828 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:06:35,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:06:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:06:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:35,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:35,829 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 8, 7, 1, 1, 1, 1] [2019-08-05 11:06:35,829 INFO L418 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:35,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:35,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1554949375, now seen corresponding path program 137 times [2019-08-05 11:06:35,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:35,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:06:35,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:35,969 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_154|], 1=[|v_#valid_155|]} [2019-08-05 11:06:35,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:35,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:35,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:35,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:35,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:35,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:35,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:35,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:35,997 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:36,339 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:36,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:36,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:36,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:06:36,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:06:36,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:06:36,340 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 29 states. [2019-08-05 11:06:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:37,851 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2019-08-05 11:06:37,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:06:37,851 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:06:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:37,852 INFO L225 Difference]: With dead ends: 186 [2019-08-05 11:06:37,852 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 11:06:37,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=1288, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:06:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 11:06:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 77. [2019-08-05 11:06:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:06:37,854 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 52 [2019-08-05 11:06:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:37,855 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:06:37,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:06:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:06:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:37,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:37,855 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 7, 6, 1, 1, 1, 1] [2019-08-05 11:06:37,856 INFO L418 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:37,856 INFO L82 PathProgramCache]: Analyzing trace with hash -680295295, now seen corresponding path program 138 times [2019-08-05 11:06:37,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:37,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:06:37,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:38,072 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_155|], 1=[|v_#valid_156|]} [2019-08-05 11:06:38,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:38,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:38,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:38,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:38,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:38,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:38,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:38,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:38,102 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 348 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:38,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:38,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:38,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:06:38,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:06:38,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:06:38,412 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 29 states. [2019-08-05 11:06:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:39,823 INFO L93 Difference]: Finished difference Result 202 states and 214 transitions. [2019-08-05 11:06:39,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:06:39,824 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:06:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:39,825 INFO L225 Difference]: With dead ends: 202 [2019-08-05 11:06:39,825 INFO L226 Difference]: Without dead ends: 202 [2019-08-05 11:06:39,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=1239, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:06:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-05 11:06:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 77. [2019-08-05 11:06:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:06:39,829 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 52 [2019-08-05 11:06:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:39,830 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:06:39,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:06:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:06:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:39,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:39,830 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 6, 5, 1, 1, 1, 1] [2019-08-05 11:06:39,831 INFO L418 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash -116257279, now seen corresponding path program 139 times [2019-08-05 11:06:39,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:39,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:06:39,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:40,204 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_156|], 1=[|v_#valid_157|]} [2019-08-05 11:06:40,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:40,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:40,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:40,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:40,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:40,221 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:40,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:40,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:40,230 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:40,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:40,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:40,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:06:40,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:06:40,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:06:40,515 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 29 states. [2019-08-05 11:06:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:41,957 INFO L93 Difference]: Finished difference Result 216 states and 228 transitions. [2019-08-05 11:06:41,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:06:41,958 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:06:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:41,958 INFO L225 Difference]: With dead ends: 216 [2019-08-05 11:06:41,959 INFO L226 Difference]: Without dead ends: 216 [2019-08-05 11:06:41,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:06:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-08-05 11:06:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 77. [2019-08-05 11:06:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:06:41,961 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 52 [2019-08-05 11:06:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:41,961 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:06:41,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:06:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:06:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:41,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:41,962 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 5, 4, 1, 1, 1, 1] [2019-08-05 11:06:41,962 INFO L418 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:41,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:41,962 INFO L82 PathProgramCache]: Analyzing trace with hash -70977663, now seen corresponding path program 140 times [2019-08-05 11:06:41,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:41,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:06:41,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:42,172 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_157|], 1=[|v_#valid_158|]} [2019-08-05 11:06:42,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:42,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:42,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:42,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:42,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:42,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:42,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:42,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:42,197 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:42,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:42,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:42,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:06:42,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:06:42,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=750, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:06:42,447 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 29 states. [2019-08-05 11:06:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:43,696 INFO L93 Difference]: Finished difference Result 228 states and 240 transitions. [2019-08-05 11:06:43,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:06:43,697 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:06:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:43,698 INFO L225 Difference]: With dead ends: 228 [2019-08-05 11:06:43,698 INFO L226 Difference]: Without dead ends: 228 [2019-08-05 11:06:43,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:06:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-08-05 11:06:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 77. [2019-08-05 11:06:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:06:43,700 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 52 [2019-08-05 11:06:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:43,700 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:06:43,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:06:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:06:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:43,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:43,701 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 4, 3, 1, 1, 1, 1] [2019-08-05 11:06:43,701 INFO L418 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:43,702 INFO L82 PathProgramCache]: Analyzing trace with hash -651935487, now seen corresponding path program 141 times [2019-08-05 11:06:43,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:43,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:06:43,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:43,906 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_158|], 1=[|v_#valid_159|]} [2019-08-05 11:06:43,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:43,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:43,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:43,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:43,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:43,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:43,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:43,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:43,935 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:44,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:44,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:44,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:06:44,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:06:44,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:06:44,153 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 29 states. [2019-08-05 11:06:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:45,530 INFO L93 Difference]: Finished difference Result 238 states and 250 transitions. [2019-08-05 11:06:45,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:06:45,530 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:06:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:45,531 INFO L225 Difference]: With dead ends: 238 [2019-08-05 11:06:45,531 INFO L226 Difference]: Without dead ends: 238 [2019-08-05 11:06:45,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=1086, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:06:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-08-05 11:06:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 77. [2019-08-05 11:06:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:06:45,534 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 52 [2019-08-05 11:06:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:45,534 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:06:45,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:06:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:06:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:45,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:45,534 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 3, 2, 1, 1, 1, 1] [2019-08-05 11:06:45,534 INFO L418 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:45,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:45,535 INFO L82 PathProgramCache]: Analyzing trace with hash 281537153, now seen corresponding path program 142 times [2019-08-05 11:06:45,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:45,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:06:45,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:45,758 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_159|], 1=[|v_#valid_160|]} [2019-08-05 11:06:45,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:45,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:45,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:45,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:45,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:45,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:45,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:45,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:45,785 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 468 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:45,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:45,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:45,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:06:45,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:06:45,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:06:45,980 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 29 states. [2019-08-05 11:06:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:47,448 INFO L93 Difference]: Finished difference Result 246 states and 258 transitions. [2019-08-05 11:06:47,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:06:47,448 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:06:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:47,449 INFO L225 Difference]: With dead ends: 246 [2019-08-05 11:06:47,449 INFO L226 Difference]: Without dead ends: 246 [2019-08-05 11:06:47,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:06:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-08-05 11:06:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 77. [2019-08-05 11:06:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:06:47,451 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 52 [2019-08-05 11:06:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:47,451 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:06:47,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:06:47,451 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:06:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:47,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:47,452 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 2, 1, 1, 1, 1, 1] [2019-08-05 11:06:47,452 INFO L418 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:47,452 INFO L82 PathProgramCache]: Analyzing trace with hash 675804161, now seen corresponding path program 143 times [2019-08-05 11:06:47,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:47,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:06:47,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:47,694 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_160|], 1=[|v_#valid_161|]} [2019-08-05 11:06:47,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:47,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:47,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:47,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:47,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:47,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:47,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:47,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:47,718 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:47,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:47,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:47,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:47,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:47,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:47,839 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 28 states. [2019-08-05 11:06:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:49,088 INFO L93 Difference]: Finished difference Result 252 states and 264 transitions. [2019-08-05 11:06:49,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:06:49,088 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-08-05 11:06:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:49,089 INFO L225 Difference]: With dead ends: 252 [2019-08-05 11:06:49,090 INFO L226 Difference]: Without dead ends: 252 [2019-08-05 11:06:49,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:06:49,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-08-05 11:06:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 77. [2019-08-05 11:06:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:06:49,093 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 52 [2019-08-05 11:06:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:49,093 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:06:49,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:06:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:06:49,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:49,094 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2019-08-05 11:06:49,094 INFO L418 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:49,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:49,094 INFO L82 PathProgramCache]: Analyzing trace with hash 725376385, now seen corresponding path program 23 times [2019-08-05 11:06:49,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:49,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:06:49,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:49,419 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_161|], 1=[|v_#valid_162|]} [2019-08-05 11:06:49,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:49,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:49,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:49,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:49,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:49,436 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:49,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:49,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:49,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:49,519 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 11:06:49,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:49,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:49,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:49,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:49,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:49,520 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 28 states. [2019-08-05 11:06:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:50,708 INFO L93 Difference]: Finished difference Result 260 states and 273 transitions. [2019-08-05 11:06:50,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:06:50,708 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-08-05 11:06:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:50,709 INFO L225 Difference]: With dead ends: 260 [2019-08-05 11:06:50,709 INFO L226 Difference]: Without dead ends: 260 [2019-08-05 11:06:50,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=807, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:06:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-08-05 11:06:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 79. [2019-08-05 11:06:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:06:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2019-08-05 11:06:50,712 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 52 [2019-08-05 11:06:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:50,712 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2019-08-05 11:06:50,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2019-08-05 11:06:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:06:50,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:50,713 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2019-08-05 11:06:50,713 INFO L418 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:50,713 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 144 times [2019-08-05 11:06:50,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:50,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:06:50,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:50,816 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_162|], 1=[|v_#valid_163|]} [2019-08-05 11:06:50,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:50,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:50,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:50,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:50,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:50,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:50,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:50,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:50,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:51,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:51,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:06:51,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:06:51,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:06:51,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:06:51,362 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand 30 states. [2019-08-05 11:06:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:52,830 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2019-08-05 11:06:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:06:52,831 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:06:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:52,831 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:06:52,831 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:06:52,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=376, Invalid=1604, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:06:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:06:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 81. [2019-08-05 11:06:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:06:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:06:52,833 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 54 [2019-08-05 11:06:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:52,834 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:06:52,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:06:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:06:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:06:52,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:52,835 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 12, 11, 1, 1, 1, 1] [2019-08-05 11:06:52,835 INFO L418 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:52,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:52,835 INFO L82 PathProgramCache]: Analyzing trace with hash 152587963, now seen corresponding path program 145 times [2019-08-05 11:06:52,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:52,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:06:52,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:52,965 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_163|], 1=[|v_#valid_164|]} [2019-08-05 11:06:52,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:52,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:52,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:52,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:52,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:52,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:52,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:52,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:52,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 314 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:53,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:53,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:06:53,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:06:53,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:06:53,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:06:53,501 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 30 states. [2019-08-05 11:06:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:54,912 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2019-08-05 11:06:54,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:06:54,913 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:06:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:54,913 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:06:54,913 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 11:06:54,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=334, Invalid=1558, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:06:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 11:06:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 81. [2019-08-05 11:06:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:06:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:06:54,916 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 54 [2019-08-05 11:06:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:54,917 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:06:54,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:06:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:06:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:06:54,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:54,917 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 11, 10, 1, 1, 1, 1] [2019-08-05 11:06:54,917 INFO L418 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:54,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:54,918 INFO L82 PathProgramCache]: Analyzing trace with hash 322500667, now seen corresponding path program 146 times [2019-08-05 11:06:54,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:54,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:06:54,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:55,149 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_164|], 1=[|v_#valid_165|]} [2019-08-05 11:06:55,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:55,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:55,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:55,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:55,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:55,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:55,348 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:06:55,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:55,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:55,349 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:55,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:55,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:06:55,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:06:55,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:06:55,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:06:55,864 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 30 states. [2019-08-05 11:06:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:57,393 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2019-08-05 11:06:57,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:06:57,394 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:06:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:57,394 INFO L225 Difference]: With dead ends: 158 [2019-08-05 11:06:57,394 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 11:06:57,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=295, Invalid=1511, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:06:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 11:06:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 81. [2019-08-05 11:06:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:06:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:06:57,396 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 54 [2019-08-05 11:06:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:57,397 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:06:57,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:06:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:06:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:06:57,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:57,398 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 10, 9, 1, 1, 1, 1] [2019-08-05 11:06:57,398 INFO L418 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:57,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2020999611, now seen corresponding path program 147 times [2019-08-05 11:06:57,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:57,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:06:57,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:57,665 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_165|], 1=[|v_#valid_166|]} [2019-08-05 11:06:57,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:57,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:57,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:57,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:57,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:57,684 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:57,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:57,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:57,692 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:06:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:58,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:58,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:06:58,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:06:58,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:06:58,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:06:58,116 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 30 states. [2019-08-05 11:06:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:59,544 INFO L93 Difference]: Finished difference Result 180 states and 193 transitions. [2019-08-05 11:06:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:06:59,545 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:06:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:59,545 INFO L225 Difference]: With dead ends: 180 [2019-08-05 11:06:59,545 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 11:06:59,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=259, Invalid=1463, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:06:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 11:06:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 81. [2019-08-05 11:06:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:06:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:06:59,548 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 54 [2019-08-05 11:06:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:59,548 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:06:59,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:06:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:06:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:06:59,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:59,549 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 9, 8, 1, 1, 1, 1] [2019-08-05 11:06:59,549 INFO L418 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash 342321979, now seen corresponding path program 148 times [2019-08-05 11:06:59,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:59,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:06:59,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:59,701 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_166|], 1=[|v_#valid_167|]} [2019-08-05 11:06:59,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:59,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:59,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:59,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:59,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:06:59,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:59,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:59,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:59,727 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:07:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:00,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:00,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:07:00,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:07:00,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:07:00,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:07:00,137 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 30 states. [2019-08-05 11:07:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:01,693 INFO L93 Difference]: Finished difference Result 200 states and 213 transitions. [2019-08-05 11:07:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:07:01,693 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:07:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:01,694 INFO L225 Difference]: With dead ends: 200 [2019-08-05 11:07:01,694 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 11:07:01,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=226, Invalid=1414, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:07:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 11:07:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 81. [2019-08-05 11:07:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:07:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:07:01,697 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 54 [2019-08-05 11:07:01,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:01,697 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:07:01,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:07:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:07:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:07:01,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:01,698 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 8, 7, 1, 1, 1, 1] [2019-08-05 11:07:01,698 INFO L418 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash -928697157, now seen corresponding path program 149 times [2019-08-05 11:07:01,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:01,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:07:01,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:01,858 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_167|], 1=[|v_#valid_168|]} [2019-08-05 11:07:01,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:01,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:07:01,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:01,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:01,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:07:01,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:01,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:01,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:07:01,883 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:07:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:02,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:02,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:07:02,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:07:02,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:07:02,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:07:02,368 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 30 states. [2019-08-05 11:07:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:03,910 INFO L93 Difference]: Finished difference Result 218 states and 231 transitions. [2019-08-05 11:07:03,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:07:03,910 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:07:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:03,911 INFO L225 Difference]: With dead ends: 218 [2019-08-05 11:07:03,911 INFO L226 Difference]: Without dead ends: 218 [2019-08-05 11:07:03,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=196, Invalid=1364, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:07:03,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-08-05 11:07:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 81. [2019-08-05 11:07:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:07:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:07:03,914 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 54 [2019-08-05 11:07:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:03,914 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:07:03,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:07:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:07:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:07:03,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:03,915 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 7, 6, 1, 1, 1, 1] [2019-08-05 11:07:03,915 INFO L418 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash -54043077, now seen corresponding path program 150 times [2019-08-05 11:07:03,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:03,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:07:03,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:04,558 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_168|], 1=[|v_#valid_169|]} [2019-08-05 11:07:04,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:04,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:07:04,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:04,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:04,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:07:04,574 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:04,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:04,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:07:04,583 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:07:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:04,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:04,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:07:04,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:07:04,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:07:04,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:07:04,906 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 30 states. [2019-08-05 11:07:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:06,394 INFO L93 Difference]: Finished difference Result 234 states and 247 transitions. [2019-08-05 11:07:06,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:07:06,394 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:07:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:06,395 INFO L225 Difference]: With dead ends: 234 [2019-08-05 11:07:06,396 INFO L226 Difference]: Without dead ends: 234 [2019-08-05 11:07:06,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=169, Invalid=1313, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:07:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-08-05 11:07:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 81. [2019-08-05 11:07:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:07:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:07:06,398 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 54 [2019-08-05 11:07:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:06,398 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:07:06,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:07:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:07:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:07:06,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:06,399 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 6, 5, 1, 1, 1, 1] [2019-08-05 11:07:06,399 INFO L418 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:06,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:06,399 INFO L82 PathProgramCache]: Analyzing trace with hash 509994939, now seen corresponding path program 151 times [2019-08-05 11:07:06,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:06,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:07:06,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:06,726 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_169|], 1=[|v_#valid_170|]} [2019-08-05 11:07:06,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:06,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:07:06,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:06,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:06,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:07:06,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:06,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:06,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:07:06,753 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:07:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:07,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:07,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:07:07,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:07:07,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:07:07,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:07:07,035 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 30 states. [2019-08-05 11:07:08,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:08,711 INFO L93 Difference]: Finished difference Result 248 states and 261 transitions. [2019-08-05 11:07:08,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:07:08,712 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:07:08,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:08,713 INFO L225 Difference]: With dead ends: 248 [2019-08-05 11:07:08,713 INFO L226 Difference]: Without dead ends: 248 [2019-08-05 11:07:08,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=145, Invalid=1261, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:07:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-08-05 11:07:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 81. [2019-08-05 11:07:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:07:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:07:08,716 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 54 [2019-08-05 11:07:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:08,716 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:07:08,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:07:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:07:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:07:08,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:08,716 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 5, 4, 1, 1, 1, 1] [2019-08-05 11:07:08,716 INFO L418 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash 555274555, now seen corresponding path program 152 times [2019-08-05 11:07:08,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:08,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:07:08,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:08,921 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_170|], 1=[|v_#valid_171|]} [2019-08-05 11:07:08,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:08,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:07:08,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:08,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:08,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:07:08,937 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:08,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:08,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:07:08,947 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:07:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:09,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:09,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:07:09,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:07:09,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:07:09,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=806, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:07:09,203 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 30 states. [2019-08-05 11:07:10,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:10,563 INFO L93 Difference]: Finished difference Result 260 states and 273 transitions. [2019-08-05 11:07:10,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:07:10,564 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:07:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:10,564 INFO L225 Difference]: With dead ends: 260 [2019-08-05 11:07:10,565 INFO L226 Difference]: Without dead ends: 260 [2019-08-05 11:07:10,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:07:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-08-05 11:07:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 81. [2019-08-05 11:07:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:07:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:07:10,567 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 54 [2019-08-05 11:07:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:10,567 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:07:10,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:07:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:07:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:07:10,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:10,568 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 4, 3, 1, 1, 1, 1] [2019-08-05 11:07:10,568 INFO L418 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:10,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:10,568 INFO L82 PathProgramCache]: Analyzing trace with hash -25683269, now seen corresponding path program 153 times [2019-08-05 11:07:10,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:10,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:07:10,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:10,788 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_171|], 1=[|v_#valid_172|]} [2019-08-05 11:07:10,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:10,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:07:10,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:10,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:10,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:07:10,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:10,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:10,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:07:10,814 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:07:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:11,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:11,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:07:11,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:07:11,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:07:11,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=809, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:07:11,052 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 30 states. [2019-08-05 11:07:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:12,649 INFO L93 Difference]: Finished difference Result 270 states and 283 transitions. [2019-08-05 11:07:12,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:07:12,650 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:07:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:12,650 INFO L225 Difference]: With dead ends: 270 [2019-08-05 11:07:12,651 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 11:07:12,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:07:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 11:07:12,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 81. [2019-08-05 11:07:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:07:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:07:12,654 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 54 [2019-08-05 11:07:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:12,654 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:07:12,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:07:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:07:12,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:07:12,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:12,655 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 3, 2, 1, 1, 1, 1] [2019-08-05 11:07:12,655 INFO L418 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:12,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:12,655 INFO L82 PathProgramCache]: Analyzing trace with hash 907789371, now seen corresponding path program 154 times [2019-08-05 11:07:12,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:12,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:07:12,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:12,995 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_172|], 1=[|v_#valid_173|]} [2019-08-05 11:07:13,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:13,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:07:13,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:13,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:13,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 11:07:13,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:13,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:13,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:07:13,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-08-05 11:07:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:13,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:13,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:07:13,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:07:13,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:07:13,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:07:13,230 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 30 states. Received shutdown request... [2019-08-05 11:07:14,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:07:14,153 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:07:14,158 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:07:14,159 INFO L202 PluginConnector]: Adding new model 960521-1_1_true-valid-memsafety.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:07:14 BoogieIcfgContainer [2019-08-05 11:07:14,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:07:14,160 INFO L168 Benchmark]: Toolchain (without parser) took 240211.84 ms. Allocated memory was 134.2 MB in the beginning and 806.9 MB in the end (delta: 672.7 MB). Free memory was 110.1 MB in the beginning and 416.9 MB in the end (delta: -306.8 MB). Peak memory consumption was 365.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:14,160 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.72 ms. Allocated memory is still 134.2 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:07:14,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.64 ms. Allocated memory is still 134.2 MB. Free memory was 110.1 MB in the beginning and 108.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:14,161 INFO L168 Benchmark]: Boogie Preprocessor took 35.93 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:14,161 INFO L168 Benchmark]: RCFGBuilder took 436.35 ms. Allocated memory is still 134.2 MB. Free memory was 107.1 MB in the beginning and 94.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:14,161 INFO L168 Benchmark]: TraceAbstraction took 239695.79 ms. Allocated memory was 134.2 MB in the beginning and 806.9 MB in the end (delta: 672.7 MB). Free memory was 93.6 MB in the beginning and 416.9 MB in the end (delta: -323.3 MB). Peak memory consumption was 349.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:14,163 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.72 ms. Allocated memory is still 134.2 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.64 ms. Allocated memory is still 134.2 MB. Free memory was 110.1 MB in the beginning and 108.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.93 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 436.35 ms. Allocated memory is still 134.2 MB. Free memory was 107.1 MB in the beginning and 94.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239695.79 ms. Allocated memory was 134.2 MB in the beginning and 806.9 MB in the end (delta: 672.7 MB). Free memory was 93.6 MB in the beginning and 416.9 MB in the end (delta: -323.3 MB). Peak memory consumption was 349.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 135). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and FLOYD_HOARE automaton (currently 24 states, 30 states before enhancement),while ReachableStatesComputation was computing reachable states (123 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 239.6s OverallTime, 179 OverallIterations, 24 TraceHistogramMax, 150.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4836 SDtfs, 4030 SDslu, 79954 SDs, 0 SdLazy, 92437 SolverSat, 4559 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 75.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7564 GetRequests, 3023 SyntacticMatches, 0 SemanticMatches, 4541 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6602 ImplicationChecksByTransitivity, 135.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=169, 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.4s AutomataMinimizationTime, 178 MinimizatonAttempts, 12012 StatesRemovedByMinimization, 166 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 84.7s InterpolantComputationTime, 6622 NumberOfCodeBlocks, 6622 NumberOfCodeBlocksAsserted, 179 NumberOfCheckSat, 6443 ConstructedInterpolants, 1630 QuantifiedInterpolants, 2225565 SizeOfPredicates, 2508 NumberOfNonLiveVariables, 40236 ConjunctsInSsa, 8703 ConjunctsInUnsatCore, 179 InterpolantComputations, 2 PerfectInterpolantSequences, 728/35974 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown