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_true-valid-memsafety.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:03:24,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:03:24,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:03:24,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:03:24,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:03:24,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:03:24,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:03:24,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:03:24,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:03:24,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:03:24,323 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:03:24,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:03:24,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:03:24,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:03:24,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:03:24,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:03:24,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:03:24,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:03:24,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:03:24,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:03:24,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:03:24,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:03:24,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:03:24,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:03:24,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:03:24,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:03:24,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:03:24,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:03:24,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:03:24,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:03:24,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:03:24,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:03:24,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:03:24,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:03:24,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:03:24,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:03:24,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:03:24,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:03:24,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:03:24,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:03:24,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:03:24,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:03:24,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:03:24,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:03:24,421 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:03:24,422 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:03:24,423 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_true-valid-memsafety.i_5.bpl [2019-08-05 11:03:24,424 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_true-valid-memsafety.i_5.bpl' [2019-08-05 11:03:24,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:03:24,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:03:24,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:03:24,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:03:24,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:03:24,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:24" (1/1) ... [2019-08-05 11:03:24,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:24" (1/1) ... [2019-08-05 11:03:24,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:03:24,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:03:24,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:03:24,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:03:24,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:24" (1/1) ... [2019-08-05 11:03:24,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:24" (1/1) ... [2019-08-05 11:03:24,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:24" (1/1) ... [2019-08-05 11:03:24,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:24" (1/1) ... [2019-08-05 11:03:24,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:24" (1/1) ... [2019-08-05 11:03:24,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:24" (1/1) ... [2019-08-05 11:03:24,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:24" (1/1) ... [2019-08-05 11:03:24,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:03:24,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:03:24,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:03:24,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:03:24,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:24" (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:24,658 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:03:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:03:24,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:03:24,949 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:03:24,949 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:03:24,951 INFO L202 PluginConnector]: Adding new model 960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:03:24 BoogieIcfgContainer [2019-08-05 11:03:24,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:03:24,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:03:24,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:03:24,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:03:24,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:24" (1/2) ... [2019-08-05 11:03:24,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b938e5d and model type 960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:03:24, skipping insertion in model container [2019-08-05 11:03:24,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:03:24" (2/2) ... [2019-08-05 11:03:24,960 INFO L109 eAbstractionObserver]: Analyzing ICFG 960521-1_true-valid-memsafety.i_5.bpl [2019-08-05 11:03:24,970 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:03:24,978 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:03:24,995 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:03:25,021 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:03:25,022 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:03:25,022 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:03:25,023 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:03:25,023 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:03:25,023 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:03:25,023 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:03:25,023 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:03:25,023 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:03:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:03:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:03:25,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:25,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:03:25,050 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-08-05 11:03:25,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:25,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:03:25,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:25,273 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_6|], 2=[|v_#valid_7|]} [2019-08-05 11:03:25,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:25,380 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 11 treesize of output 13 [2019-08-05 11:03:25,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:25,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:25,501 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 23 treesize of output 21 [2019-08-05 11:03:25,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:03:25,617 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 11:03:25,618 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:03:25,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:25,625 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:25,761 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:25,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:03:25,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:03:25,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:03:25,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:03:25,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:03:25,784 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 11:03:26,014 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 11:03:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:26,153 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:03:26,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:03:26,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:03:26,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:26,166 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:03:26,166 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:03:26,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:03:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:03:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 11:03:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:03:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:03:26,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 11:03:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:26,204 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:03:26,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:03:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:03:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:03:26,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:26,205 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:03:26,206 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-08-05 11:03:26,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:26,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:03:26,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:26,286 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_7|], 2=[|v_#valid_8|]} [2019-08-05 11:03:26,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:26,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 11:03:26,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:26,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:26,446 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 23 treesize of output 21 [2019-08-05 11:03:26,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:03:26,703 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 11:03:26,703 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:03:26,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:26,706 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:26,902 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:26,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:26,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:03:26,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:03:26,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:03:26,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:03:26,905 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 11:03:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:27,028 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:03:27,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:03:27,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:03:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:27,032 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:03:27,032 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:03:27,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:03:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:03:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 11:03:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:03:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:03:27,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 11:03:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:27,036 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:03:27,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:03:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:03:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:03:27,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:27,037 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 11:03:27,037 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:27,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:27,038 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2019-08-05 11:03:27,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:27,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:03:27,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:27,127 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_8|], 2=[|v_#valid_9|]} [2019-08-05 11:03:27,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:27,135 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 11 treesize of output 13 [2019-08-05 11:03:27,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:27,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:27,199 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 38 treesize of output 34 [2019-08-05 11:03:27,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:27,265 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:03:27,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:27,267 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:27,663 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:03:27,778 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:27,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:27,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:03:27,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:03:27,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:03:27,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:03:27,780 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 11:03:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:28,028 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:03:28,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:03:28,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:03:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:28,030 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:03:28,031 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:03:28,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:03:28,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:03:28,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 11:03:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:03:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:03:28,034 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 11:03:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:28,035 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:03:28,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:03:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:03:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:03:28,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:28,036 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 11:03:28,036 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:28,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2019-08-05 11:03:28,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:28,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:03:28,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:28,173 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_9|], 2=[|v_#valid_10|]} [2019-08-05 11:03:28,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:28,186 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,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:28,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:28,230 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 32 treesize of output 30 [2019-08-05 11:03:28,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:28,289 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:03:28,291 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,292 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:03:28,496 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:28,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:28,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:03:28,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:03:28,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:03:28,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:03:28,498 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 11:03:28,762 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-08-05 11:03:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:28,941 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:03:28,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:03:28,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 11:03:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:28,943 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:03:28,943 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:03:28,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:28,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:03:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 11:03:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:03:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:03:28,948 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 11:03:28,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:28,948 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:03:28,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:03:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:03:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:03:28,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:28,949 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 11:03:28,949 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:28,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2019-08-05 11:03:28,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:29,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:03:29,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:29,024 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_10|], 2=[|v_#valid_11|]} [2019-08-05 11:03:29,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:29,039 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 11 treesize of output 13 [2019-08-05 11:03:29,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:29,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:29,089 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 23 treesize of output 21 [2019-08-05 11:03:29,090 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:03:29,127 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:03:29,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:29,130 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:29,374 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:29,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:29,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:03:29,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:03:29,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:03:29,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:03:29,376 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-08-05 11:03:29,774 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-08-05 11:03:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:29,991 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:03:29,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:03:29,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 11:03:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:29,993 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:03:29,993 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:03:29,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:03:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 11:03:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:03:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:03:29,996 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 11:03:29,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:29,997 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:03:29,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:03:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:03:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:03:29,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:29,998 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 11:03:29,998 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:29,999 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2019-08-05 11:03:30,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:30,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:03:30,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:30,083 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_11|], 2=[|v_#valid_12|]} [2019-08-05 11:03:30,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:30,138 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,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:30,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:30,206 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 23 treesize of output 21 [2019-08-05 11:03:30,207 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:03:30,236 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:03:30,237 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,238 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:03:30,436 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:30,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:30,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:03:30,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:03:30,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:03:30,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:03:30,440 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2019-08-05 11:03:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:30,981 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:03:30,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:03:30,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 11:03:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:30,983 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:03:30,983 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:03:30,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:03:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 11:03:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:03:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:03:30,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 11:03:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:30,988 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:03:30,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:03:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:03:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:03:30,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:30,989 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 11:03:30,989 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:30,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:30,989 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2019-08-05 11:03:30,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:31,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:03:31,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:31,058 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_12|], 2=[|v_#valid_13|]} [2019-08-05 11:03:31,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:31,070 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,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:31,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:31,111 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 38 treesize of output 34 [2019-08-05 11:03:31,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:31,285 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-08-05 11:03:31,285 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:03:31,286 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,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:03:31,538 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,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:31,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:03:31,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:03:31,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:03:31,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:03:31,540 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2019-08-05 11:03:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:32,135 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:03:32,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:03:32,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-05 11:03:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:32,139 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:03:32,139 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:03:32,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:03:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:03:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 11:03:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:03:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:03:32,143 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 11:03:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:32,144 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:03:32,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:03:32,144 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:03:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:03:32,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:32,145 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 11:03:32,145 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:32,145 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2019-08-05 11:03:32,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:32,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:03:32,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:32,223 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_13|], 2=[|v_#valid_14|]} [2019-08-05 11:03:32,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:32,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 11 treesize of output 13 [2019-08-05 11:03:32,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:32,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:32,302 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 38 treesize of output 34 [2019-08-05 11:03:32,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:32,344 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:03:32,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:32,346 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:32,660 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:32,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:32,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:03:32,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:03:32,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:03:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:03:32,662 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-08-05 11:03:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:33,293 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:03:33,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:03:33,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 11:03:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:33,295 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:03:33,295 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:03:33,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:03:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:03:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 11:03:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:03:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:03:33,299 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 11:03:33,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:33,299 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:03:33,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:03:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:03:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:03:33,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:33,300 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 11:03:33,300 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:33,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:33,300 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2019-08-05 11:03:33,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:33,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:03:33,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:33,362 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_14|], 2=[|v_#valid_15|]} [2019-08-05 11:03:33,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:33,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:33,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:33,491 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 23 treesize of output 21 [2019-08-05 11:03:33,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:03:33,536 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:03:33,537 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,537 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:03:33,790 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:33,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:33,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:03:33,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:03:33,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:03:33,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:33,792 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2019-08-05 11:03:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:34,512 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:03:34,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:03:34,513 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-05 11:03:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:34,514 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:03:34,515 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:03:34,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:03:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:03:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 11:03:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:03:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:03:34,519 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 11:03:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:34,519 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:03:34,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:03:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:03:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:03:34,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:34,520 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 11:03:34,520 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2019-08-05 11:03:34,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:34,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:03:34,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:34,630 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_15|], 2=[|v_#valid_16|]} [2019-08-05 11:03:34,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:34,678 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 11 treesize of output 13 [2019-08-05 11:03:34,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:34,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:34,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 38 treesize of output 34 [2019-08-05 11:03:34,714 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:34,740 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:03:34,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:34,741 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:35,038 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:35,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:35,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:03:35,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:03:35,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:03:35,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:03:35,040 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2019-08-05 11:03:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:35,778 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:03:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:03:35,779 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 11:03:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:35,780 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:03:35,780 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:03:35,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:03:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:03:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 11:03:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:03:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:03:35,784 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 11:03:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:35,784 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:03:35,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:03:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:03:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:03:35,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:35,785 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 11:03:35,786 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:35,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2019-08-05 11:03:35,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:35,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:03:35,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:35,866 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_16|], 2=[|v_#valid_17|]} [2019-08-05 11:03:35,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:35,922 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,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:36,061 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:03:36,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:36,136 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 32 treesize of output 30 [2019-08-05 11:03:36,137 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:36,162 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:03:36,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:03:36,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:03:36,716 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:03:37,020 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-08-05 11:03:37,348 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 11:03:37,692 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:03:37,702 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:37,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:37,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:03:37,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:03:37,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:03:37,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:37,704 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 15 states. [2019-08-05 11:03:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:38,607 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:03:38,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:03:38,607 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-08-05 11:03:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:38,608 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:03:38,608 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:03:38,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:03:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:03:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 11:03:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:03:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:03:38,613 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 11:03:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:38,613 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:03:38,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:03:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:03:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:03:38,614 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:38,614 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 11:03:38,615 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:38,615 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2019-08-05 11:03:38,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:38,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:03:38,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:38,688 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_17|], 2=[|v_#valid_18|]} [2019-08-05 11:03:38,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:38,742 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 11 treesize of output 13 [2019-08-05 11:03:38,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:38,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:38,783 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 23 treesize of output 21 [2019-08-05 11:03:38,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:03:38,826 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:03:38,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:38,829 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:39,156 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:39,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:39,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:03:39,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:03:39,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:03:39,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:03:39,158 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 16 states. [2019-08-05 11:03:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:39,940 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:03:39,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:03:39,943 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 11:03:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:39,944 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:03:39,944 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:03:39,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:03:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:03:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 11:03:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:03:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:03:39,948 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 11:03:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:39,948 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:03:39,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:03:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:03:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:03:39,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:39,950 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 11:03:39,950 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:39,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:39,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2019-08-05 11:03:39,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:40,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:03:40,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:40,024 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_18|], 2=[|v_#valid_19|]} [2019-08-05 11:03:40,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:40,068 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 11 treesize of output 13 [2019-08-05 11:03:40,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:40,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:40,140 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 23 treesize of output 21 [2019-08-05 11:03:40,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:03:40,171 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:03:40,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:40,173 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:40,468 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:40,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:40,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:03:40,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:03:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:03:40,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:40,469 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2019-08-05 11:03:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:41,356 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:03:41,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:03:41,356 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 11:03:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:41,357 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:03:41,357 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:03:41,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:03:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:03:41,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 11:03:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:03:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:03:41,364 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 11:03:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:41,364 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:03:41,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:03:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:03:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:03:41,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:41,367 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 11:03:41,367 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:41,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:41,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2019-08-05 11:03:41,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:41,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:03:41,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:41,450 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_19|], 2=[|v_#valid_20|]} [2019-08-05 11:03:41,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:41,468 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,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:41,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:41,499 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 38 treesize of output 34 [2019-08-05 11:03:41,500 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:41,543 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:03:41,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:03:41,545 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:03:41,906 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:03:41,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:41,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:03:41,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:03:41,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:03:41,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:03:41,907 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2019-08-05 11:03:42,830 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-08-05 11:03:43,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:43,174 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:03:43,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:03:43,174 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 11:03:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:43,175 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:03:43,175 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:03:43,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:03:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:03:43,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 11:03:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:03:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:03:43,180 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 11:03:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:43,180 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:03:43,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:03:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:03:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:03:43,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:43,181 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 11:03:43,181 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:43,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:43,182 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2019-08-05 11:03:43,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:43,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:03:43,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:43,259 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_20|], 2=[|v_#valid_21|]} [2019-08-05 11:03:43,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:43,302 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 11 treesize of output 13 [2019-08-05 11:03:43,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:43,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:43,370 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 23 treesize of output 21 [2019-08-05 11:03:43,371 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:03:43,399 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:03:43,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:43,400 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:43,897 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:03:43,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:43,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:03:43,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:03:43,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:03:43,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:03:43,899 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 19 states. [2019-08-05 11:03:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:44,918 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:03:44,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:03:44,919 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 11:03:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:44,920 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:03:44,920 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:03:44,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:03:44,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:03:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 11:03:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:03:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:03:44,924 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 11:03:44,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:44,925 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:03:44,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:03:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:03:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:03:44,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:44,926 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 11:03:44,926 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2019-08-05 11:03:44,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:44,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:03:44,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:45,018 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_21|], 2=[|v_#valid_22|]} [2019-08-05 11:03:45,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:45,072 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 11 treesize of output 13 [2019-08-05 11:03:45,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:45,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:45,135 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 23 treesize of output 21 [2019-08-05 11:03:45,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:03:45,169 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:03:45,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:45,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:45,605 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:03:45,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:45,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:03:45,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:03:45,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:03:45,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:03:45,607 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 20 states. [2019-08-05 11:03:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:46,834 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:03:46,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:03:46,836 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 11:03:46,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:46,837 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:03:46,837 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:03:46,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:03:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:03:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 11:03:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:03:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:03:46,840 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 11:03:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:46,841 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:03:46,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:03:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:03:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:03:46,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:46,842 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 11:03:46,842 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:46,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:46,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2019-08-05 11:03:46,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:46,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:03:46,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:46,920 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_22|], 2=[|v_#valid_23|]} [2019-08-05 11:03:46,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:46,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 11:03:46,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:46,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:46,999 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 23 treesize of output 21 [2019-08-05 11:03:46,999 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:03:47,029 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:03:47,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:47,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:47,500 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:03:47,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:47,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:03:47,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:03:47,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:03:47,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:03:47,502 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 21 states. [2019-08-05 11:03:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:48,746 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:03:48,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:03:48,747 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 11:03:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:48,748 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:03:48,748 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:03:48,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:03:48,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:03:48,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 11:03:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:03:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:03:48,753 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 11:03:48,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:48,754 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:03:48,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:03:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:03:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:03:48,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:48,755 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 11:03:48,755 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:48,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:48,755 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2019-08-05 11:03:48,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:48,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:03:48,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:48,843 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_23|], 2=[|v_#valid_24|]} [2019-08-05 11:03:48,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:48,892 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:48,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:49,027 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:03:49,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:49,100 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 32 treesize of output 30 [2019-08-05 11:03:49,101 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:49,435 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-08-05 11:03:49,435 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:03:49,436 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,437 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:03:49,584 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:03:49,755 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:03:49,946 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:03:50,619 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:03:50,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:50,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:03:50,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:03:50,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:03:50,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:03:50,621 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 22 states. [2019-08-05 11:03:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:51,938 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:03:51,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:03:51,938 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 11:03:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:51,939 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:03:51,939 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:03:51,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=575, Invalid=1065, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:03:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:03:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 11:03:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:03:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:03:51,944 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 11:03:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:51,944 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:03:51,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:03:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:03:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:03:51,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:51,945 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 11:03:51,945 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:51,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:51,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2019-08-05 11:03:51,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:52,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:03:52,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:52,031 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 2=[|v_#valid_25|]} [2019-08-05 11:03:52,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:52,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:52,231 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:03:52,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:52,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 38 treesize of output 34 [2019-08-05 11:03:52,306 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:52,620 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-08-05 11:03:52,621 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:03:52,621 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:52,622 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:03:52,776 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:03:52,966 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:03:53,635 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:03:53,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:53,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:03:53,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:03:53,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:03:53,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:03:53,636 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 23 states. [2019-08-05 11:03:54,485 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-08-05 11:03:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:55,313 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:03:55,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:03:55,314 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 11:03:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:55,315 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:03:55,315 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:03:55,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:03:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:03:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 11:03:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:03:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:03:55,319 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 11:03:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:55,320 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:03:55,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:03:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:03:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:03:55,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:55,321 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 11:03:55,321 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:55,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:55,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2019-08-05 11:03:55,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:55,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:03:55,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:55,464 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_25|], 2=[|v_#valid_26|]} [2019-08-05 11:03:55,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:55,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:03:55,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:55,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:55,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 38 treesize of output 34 [2019-08-05 11:03:55,587 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:55,608 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:03:55,608 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:55,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:03:56,244 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:03:56,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:56,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:03:56,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:03:56,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:03:56,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:03:56,246 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 24 states. [2019-08-05 11:03:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:58,189 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:03:58,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:03:58,190 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:03:58,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:58,190 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:03:58,191 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:03:58,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=698, Invalid=1282, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:03:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:03:58,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 11:03:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:03:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:03:58,196 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 11:03:58,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:58,196 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:03:58,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:03:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:03:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:03:58,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:58,197 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 11:03:58,198 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:58,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:58,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2019-08-05 11:03:58,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:58,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:03:58,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:58,301 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_26|], 2=[|v_#valid_27|]} [2019-08-05 11:03:58,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:58,358 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 11 treesize of output 13 [2019-08-05 11:03:58,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:58,441 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 32 treesize of output 30 [2019-08-05 11:03:58,442 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:58,465 INFO L567 ElimStorePlain]: treesize reduction 12, result has 68.4 percent of original size [2019-08-05 11:03:58,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:58,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:59,225 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:03:59,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:59,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:03:59,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:03:59,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:03:59,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:03:59,226 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 25 states. [2019-08-05 11:04:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:00,715 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:04:00,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:04:00,716 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:04:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:00,717 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:04:00,717 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:04:00,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:04:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:04:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 11:04:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:04:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:04:00,721 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 11:04:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:00,722 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:04:00,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:04:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:04:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:04:00,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:00,723 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 11:04:00,723 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:00,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2019-08-05 11:04:00,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:00,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:04:00,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:00,815 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_27|], 2=[|v_#valid_28|]} [2019-08-05 11:04:00,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:00,851 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 11 treesize of output 13 [2019-08-05 11:04:00,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,885 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 38 treesize of output 34 [2019-08-05 11:04:00,886 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,910 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:04:00,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:00,911 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:04:02,552 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:04:03,226 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:04:05,016 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:04:05,329 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:04:05,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:05,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:04:05,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:04:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:04:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:04:05,331 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 26 states. [2019-08-05 11:04:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:06,865 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:04:06,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:04:06,867 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:04:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:06,868 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:04:06,868 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:04:06,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=833, Invalid=1519, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:04:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:04:06,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 11:04:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:04:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:04:06,872 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 11:04:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:06,873 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:04:06,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:04:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:04:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:04:06,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:06,873 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 11:04:06,874 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:06,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:06,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2019-08-05 11:04:06,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:06,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:04:06,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:06,963 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_28|], 2=[|v_#valid_29|]} [2019-08-05 11:04:07,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:07,012 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 11 treesize of output 13 [2019-08-05 11:04:07,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:07,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:07,063 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 23 treesize of output 21 [2019-08-05 11:04:07,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:07,093 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:04:07,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:07,094 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:04:07,800 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:04:07,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:07,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:04:07,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:04:07,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:04:07,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=419, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:04:07,802 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 27 states. [2019-08-05 11:04:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:09,509 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:04:09,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:04:09,510 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:04:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:09,510 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:04:09,511 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:04:09,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=905, Invalid=1645, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:04:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:04:09,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 11:04:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:04:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:04:09,516 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 11:04:09,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:09,516 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:04:09,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:04:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:04:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:04:09,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:09,517 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 11:04:09,518 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:09,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:09,518 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2019-08-05 11:04:09,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:09,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:04:09,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:09,616 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_29|], 2=[|v_#valid_30|]} [2019-08-05 11:04:09,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:09,665 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 11 treesize of output 13 [2019-08-05 11:04:09,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:09,808 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:04:09,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:09,814 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 23 treesize of output 21 [2019-08-05 11:04:09,815 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:09,844 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:04:09,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:09,846 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:04:10,559 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:04:10,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:10,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:04:10,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:04:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:04:10,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:04:10,561 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 28 states. [2019-08-05 11:04:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:12,316 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:04:12,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:04:12,317 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:04:12,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:12,317 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:04:12,317 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:04:12,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=980, Invalid=1776, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:04:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:04:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 11:04:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:04:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:04:12,322 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 11:04:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:12,322 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:04:12,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:04:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:04:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:04:12,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:12,323 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 11:04:12,323 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:12,323 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2019-08-05 11:04:12,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:12,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:04:12,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:12,433 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 2=[|v_#valid_31|]} [2019-08-05 11:04:12,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:12,486 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 11 treesize of output 13 [2019-08-05 11:04:12,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:12,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:12,564 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 23 treesize of output 21 [2019-08-05 11:04:12,564 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:12,618 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:04:12,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:12,620 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:04:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:13,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:13,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:04:13,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:04:13,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:04:13,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=480, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:04:13,808 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 29 states. [2019-08-05 11:04:15,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:15,720 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:04:15,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:04:15,721 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:04:15,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:15,722 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:04:15,722 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:04:15,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1058, Invalid=1912, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:04:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:04:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 11:04:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:04:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:04:15,726 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 11:04:15,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:15,727 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:04:15,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:04:15,727 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:04:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:04:15,727 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:15,727 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 11:04:15,728 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:15,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:15,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2019-08-05 11:04:15,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:15,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:04:15,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:15,859 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|], 2=[|v_#valid_32|]} [2019-08-05 11:04:15,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:15,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 11:04:15,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:16,087 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:04:16,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:16,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 23 treesize of output 21 [2019-08-05 11:04:16,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:16,167 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:04:16,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:16,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:04:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:16,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:16,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:04:16,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:04:16,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:04:16,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:04:16,997 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 30 states. [2019-08-05 11:04:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:19,030 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:04:19,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:04:19,033 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:04:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:19,033 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:04:19,033 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:04:19,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1139, Invalid=2053, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:04:19,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:04:19,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 11:04:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:04:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:04:19,037 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 11:04:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:19,037 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:04:19,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:04:19,037 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:04:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:04:19,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:19,038 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 11:04:19,038 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:19,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2019-08-05 11:04:19,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:19,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:04:19,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:19,164 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_32|], 2=[|v_#valid_33|]} [2019-08-05 11:04:19,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:19,216 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 11 treesize of output 13 [2019-08-05 11:04:19,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:19,364 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:04:19,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:19,368 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 23 treesize of output 21 [2019-08-05 11:04:19,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:19,399 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:04:19,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:19,400 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:04:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:20,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:20,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:04:20,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:04:20,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:04:20,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=545, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:04:20,207 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 31 states. [2019-08-05 11:04:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:22,278 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:04:22,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:04:22,279 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2019-08-05 11:04:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:22,280 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:04:22,280 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:04:22,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1223, Invalid=2199, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:04:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:04:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 11:04:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:04:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:04:22,284 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 11:04:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:22,284 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:04:22,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:04:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:04:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:04:22,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:22,285 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 11:04:22,285 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:22,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2019-08-05 11:04:22,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:22,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:04:22,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:22,400 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 2=[|v_#valid_34|]} [2019-08-05 11:04:22,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:22,453 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 11 treesize of output 13 [2019-08-05 11:04:22,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:22,619 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:04:22,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:22,688 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 38 treesize of output 34 [2019-08-05 11:04:22,689 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:23,060 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-08-05 11:04:23,060 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:04:23,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:23,061 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:04:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:24,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:24,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:04:24,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:04:24,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:04:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=579, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:04:24,294 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 32 states. [2019-08-05 11:04:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:26,434 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:04:26,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:04:26,435 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2019-08-05 11:04:26,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:26,435 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:04:26,436 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:04:26,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1310, Invalid=2350, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:04:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:04:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 11:04:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:04:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:04:26,440 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 11:04:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:26,441 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:04:26,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:04:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:04:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:04:26,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:26,441 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 11:04:26,442 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:26,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:26,442 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2019-08-05 11:04:26,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:26,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:04:26,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:26,558 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_34|], 2=[|v_#valid_35|]} [2019-08-05 11:04:26,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:26,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 11:04:26,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:26,767 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:04:26,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:26,825 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 23 treesize of output 21 [2019-08-05 11:04:26,825 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:27,286 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 11:04:27,286 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:04:27,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:27,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:04:28,258 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:28,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:28,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:04:28,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:04:28,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:04:28,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=614, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:04:28,259 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 33 states. [2019-08-05 11:04:29,895 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-08-05 11:04:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:30,678 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:04:30,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:04:30,679 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 60 [2019-08-05 11:04:30,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:30,680 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:04:30,680 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:04:30,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:04:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:04:30,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 11:04:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:04:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:04:30,684 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 11:04:30,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:30,684 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:04:30,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:04:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:04:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:04:30,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:30,685 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 11:04:30,685 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:30,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:30,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2019-08-05 11:04:30,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:30,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:04:30,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:30,802 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_35|], 2=[|v_#valid_36|]} [2019-08-05 11:04:30,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:30,856 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,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:31,008 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:04:31,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:31,074 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 23 treesize of output 21 [2019-08-05 11:04:31,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:31,172 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:04:31,173 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:31,173 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:04:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:32,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:32,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:04:32,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:04:32,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:04:32,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:04:32,207 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 34 states. [2019-08-05 11:04:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:34,847 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:04:34,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:04:34,848 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-08-05 11:04:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:34,849 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:04:34,849 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:04:34,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1493, Invalid=2667, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:04:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:04:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 11:04:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:04:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:04:34,853 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 11:04:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:34,853 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:04:34,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:04:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:04:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:04:34,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:34,854 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 11:04:34,854 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2019-08-05 11:04:34,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:34,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:04:34,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:34,971 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 2=[|v_#valid_37|]} [2019-08-05 11:04:35,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:35,012 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 11 treesize of output 13 [2019-08-05 11:04:35,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:35,123 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:04:35,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:35,144 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 23 treesize of output 21 [2019-08-05 11:04:35,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:35,172 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:04:35,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:35,173 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:04:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:36,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:36,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:04:36,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:04:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:04:36,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=687, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:04:36,056 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 35 states. [2019-08-05 11:04:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:38,523 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:04:38,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:04:38,524 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 64 [2019-08-05 11:04:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:38,525 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:04:38,525 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:04:38,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1589, Invalid=2833, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:04:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:04:38,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 11:04:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:04:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:04:38,529 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 11:04:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:38,529 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:04:38,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:04:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:04:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:04:38,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:38,530 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 11:04:38,530 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:38,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:38,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2019-08-05 11:04:38,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:38,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:04:38,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:38,685 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_37|], 2=[|v_#valid_38|]} [2019-08-05 11:04:38,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:38,737 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 11 treesize of output 13 [2019-08-05 11:04:38,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,798 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 38 treesize of output 34 [2019-08-05 11:04:38,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,836 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:04:38,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:38,836 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:04:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:40,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:40,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:04:40,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:04:40,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:04:40,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=725, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:04:40,175 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2019-08-05 11:04:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:42,808 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:04:42,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:04:42,808 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2019-08-05 11:04:42,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:42,809 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:04:42,809 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:04:42,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1688, Invalid=3004, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:04:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:04:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 11:04:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:04:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:04:42,813 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 11:04:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:42,813 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:04:42,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:04:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:04:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:04:42,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:42,814 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 11:04:42,814 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:42,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:42,815 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2019-08-05 11:04:42,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:42,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:04:42,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:42,954 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 2=[|v_#valid_39|]} [2019-08-05 11:04:43,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:43,001 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 11 treesize of output 13 [2019-08-05 11:04:43,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:43,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:43,033 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 38 treesize of output 34 [2019-08-05 11:04:43,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:43,057 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:04:43,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:43,058 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:04:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:44,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:44,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:04:44,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:04:44,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:04:44,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=764, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:04:44,070 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 37 states. [2019-08-05 11:04:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:46,766 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:04:46,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:04:46,766 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2019-08-05 11:04:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:46,767 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:04:46,768 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:04:46,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1790, Invalid=3180, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:04:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:04:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 11:04:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:04:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:04:46,770 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 11:04:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:46,771 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:04:46,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:04:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:04:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:04:46,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:46,771 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 11:04:46,772 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:46,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2019-08-05 11:04:46,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:46,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:04:46,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:46,895 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_39|], 2=[|v_#valid_40|]} [2019-08-05 11:04:46,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:46,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:46,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:46,973 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 32 treesize of output 30 [2019-08-05 11:04:46,974 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:46,996 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:04:46,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:04:46,997 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:04:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:48,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:48,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:04:48,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:04:48,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:04:48,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:04:48,261 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 38 states. [2019-08-05 11:04:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:51,405 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:04:51,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:04:51,405 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2019-08-05 11:04:51,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:51,406 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:04:51,407 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:04:51,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1895, Invalid=3361, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:04:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:04:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 11:04:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:04:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:04:51,410 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 11:04:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:51,411 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:04:51,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:04:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:04:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:04:51,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:51,411 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 11:04:51,412 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:51,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:51,412 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2019-08-05 11:04:51,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:51,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:04:51,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:51,550 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_40|], 2=[|v_#valid_41|]} [2019-08-05 11:04:51,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:51,586 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,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:51,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:51,619 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 32 treesize of output 30 [2019-08-05 11:04:51,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:51,639 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:04:51,639 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,639 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:04:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:52,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:52,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:04:52,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:04:52,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:04:52,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=845, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:04:52,957 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 39 states. [2019-08-05 11:04:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:56,179 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:04:56,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:04:56,180 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2019-08-05 11:04:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:56,181 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:04:56,181 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:04:56,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2003, Invalid=3547, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:04:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:04:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 11:04:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:04:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:04:56,184 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 11:04:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:56,185 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:04:56,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:04:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:04:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:04:56,185 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:56,186 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 11:04:56,186 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:56,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:56,186 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2019-08-05 11:04:56,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:56,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:04:56,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:56,312 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_41|], 2=[|v_#valid_42|]} [2019-08-05 11:04:56,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:56,366 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 11 treesize of output 13 [2019-08-05 11:04:56,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:56,523 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:04:56,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:56,598 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 38 treesize of output 34 [2019-08-05 11:04:56,598 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:56,626 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:04:56,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:56,627 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:04:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:57,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:57,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:04:57,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:04:57,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:04:57,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=887, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:04:57,777 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 40 states. [2019-08-05 11:05:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:00,938 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:05:00,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:05:00,939 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-08-05 11:05:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:00,940 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:05:00,940 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:05:00,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2114, Invalid=3738, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:05:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:05:00,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 11:05:00,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:05:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:05:00,943 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 11:05:00,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:00,943 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:05:00,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:05:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:05:00,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:05:00,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:00,944 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 11:05:00,944 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:00,944 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2019-08-05 11:05:00,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:01,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:05:01,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:01,083 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_42|], 2=[|v_#valid_43|]} [2019-08-05 11:05:01,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:01,099 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 11 treesize of output 13 [2019-08-05 11:05:01,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:01,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:01,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 38 treesize of output 34 [2019-08-05 11:05:01,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:01,162 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:05:01,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:01,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:05:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:02,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:02,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:05:02,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:05:02,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:05:02,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=930, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:05:02,299 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 41 states. [2019-08-05 11:05:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:05,573 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:05:05,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:05:05,573 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2019-08-05 11:05:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:05,574 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:05:05,575 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:05:05,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2228, Invalid=3934, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:05:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:05:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 11:05:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:05:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:05:05,578 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 11:05:05,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:05,579 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:05:05,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:05:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:05:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:05:05,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:05,579 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 11:05:05,580 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:05,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:05,580 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2019-08-05 11:05:05,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:05,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:05:05,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:05,717 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_43|], 2=[|v_#valid_44|]} [2019-08-05 11:05:05,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:05,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 11 treesize of output 13 [2019-08-05 11:05:05,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:05,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:05,767 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 38 treesize of output 34 [2019-08-05 11:05:05,768 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:05,793 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:05:05,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:05,794 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:05:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:06,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:06,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:05:06,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:05:06,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:05:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:05:06,964 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 42 states. [2019-08-05 11:05:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:10,405 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:05:10,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:05:10,405 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2019-08-05 11:05:10,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:10,406 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:05:10,407 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:05:10,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2345, Invalid=4135, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:05:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:05:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 11:05:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:05:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:05:10,411 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 11:05:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:10,411 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:05:10,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:05:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:05:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:05:10,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:10,412 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 11:05:10,413 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:10,413 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2019-08-05 11:05:10,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:10,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:05:10,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:10,545 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_44|], 2=[|v_#valid_45|]} [2019-08-05 11:05:10,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:10,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 11 treesize of output 13 [2019-08-05 11:05:10,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:10,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:10,596 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 38 treesize of output 34 [2019-08-05 11:05:10,597 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:10,621 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:05:10,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:10,622 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:05:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:11,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:11,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:05:11,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:05:11,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:05:11,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:05:11,855 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 43 states. [2019-08-05 11:05:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:15,483 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:05:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:05:15,484 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 80 [2019-08-05 11:05:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:15,485 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:05:15,485 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:05:15,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2465, Invalid=4341, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:05:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:05:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 11:05:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:05:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:05:15,487 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 11:05:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:15,488 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:05:15,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:05:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:05:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:05:15,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:15,489 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 11:05:15,489 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2019-08-05 11:05:15,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:15,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:05:15,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:15,596 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_45|], 2=[|v_#valid_46|]} [2019-08-05 11:05:15,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:15,617 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 11 treesize of output 13 [2019-08-05 11:05:15,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:15,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:15,640 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 23 treesize of output 21 [2019-08-05 11:05:15,640 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:05:15,667 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:05:15,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:15,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:05:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:17,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:17,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:05:17,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:05:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:05:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=1065, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:05:17,189 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 44 states. [2019-08-05 11:05:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:20,970 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 11:05:20,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:05:20,970 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2019-08-05 11:05:20,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:20,971 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:05:20,971 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:05:20,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2588, Invalid=4552, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:05:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:05:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 11:05:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:05:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:05:20,975 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 11:05:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:20,975 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:05:20,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:05:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:05:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:05:20,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:20,976 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 11:05:20,976 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:20,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:20,976 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2019-08-05 11:05:20,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:21,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:05:21,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:21,122 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_46|], 2=[|v_#valid_47|]} [2019-08-05 11:05:21,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:21,143 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 11 treesize of output 13 [2019-08-05 11:05:21,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:21,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:21,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 23 treesize of output 21 [2019-08-05 11:05:21,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:05:21,208 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:05:21,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:21,209 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:05:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:22,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:22,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:05:22,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:05:22,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:05:22,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=1112, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:05:22,648 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 45 states. [2019-08-05 11:05:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:26,520 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:05:26,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:05:26,521 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2019-08-05 11:05:26,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:26,522 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:05:26,522 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:05:26,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2714, Invalid=4768, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:05:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:05:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 11:05:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:05:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:05:26,525 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 11:05:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:26,525 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:05:26,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:05:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:05:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:05:26,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:26,526 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 11:05:26,526 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:26,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2019-08-05 11:05:26,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:26,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:05:26,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:26,648 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_47|], 2=[|v_#valid_48|]} [2019-08-05 11:05:26,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:26,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 11:05:26,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:26,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:26,681 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 38 treesize of output 34 [2019-08-05 11:05:26,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:26,705 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:05:26,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:26,706 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:05:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:28,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:28,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:05:28,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:05:28,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:05:28,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:05:28,842 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 46 states. [2019-08-05 11:05:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:32,768 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 11:05:32,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:05:32,769 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2019-08-05 11:05:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:32,769 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:05:32,770 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:05:32,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2843, Invalid=4989, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:05:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:05:32,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 11:05:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:05:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:05:32,773 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 11:05:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:32,773 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:05:32,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:05:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:05:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:05:32,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:32,774 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 11:05:32,774 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:32,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:32,775 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2019-08-05 11:05:32,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:32,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:05:32,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:32,905 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_48|], 2=[|v_#valid_49|]} [2019-08-05 11:05:32,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:32,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:32,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:32,958 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 23 treesize of output 21 [2019-08-05 11:05:32,959 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:05:32,985 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:05:32,985 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,986 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:05:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:34,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:34,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:05:34,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:05:34,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:05:34,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1209, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:05:34,855 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 47 states. [2019-08-05 11:05:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:39,401 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 11:05:39,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:05:39,402 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 88 [2019-08-05 11:05:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:39,403 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:05:39,403 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:05:39,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2975, Invalid=5215, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:05:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:05:39,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 11:05:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:05:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:05:39,407 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 11:05:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:39,407 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:05:39,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:05:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:05:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:05:39,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:39,408 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 11:05:39,408 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:39,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:39,409 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2019-08-05 11:05:39,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:39,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:05:39,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:39,568 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_49|], 2=[|v_#valid_50|]} [2019-08-05 11:05:39,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:39,591 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 11 treesize of output 13 [2019-08-05 11:05:39,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:39,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:39,620 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 38 treesize of output 34 [2019-08-05 11:05:39,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:39,646 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:05:39,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:39,648 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:05:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:41,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:41,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:05:41,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:05:41,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:05:41,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=997, Invalid=1259, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:05:41,443 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 48 states. [2019-08-05 11:05:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:45,723 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:05:45,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:05:45,723 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2019-08-05 11:05:45,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:45,724 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:05:45,725 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:05:45,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3110, Invalid=5446, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:05:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:05:45,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 11:05:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:05:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:05:45,728 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 11:05:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:45,728 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:05:45,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:05:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:05:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:05:45,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:45,729 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 11:05:45,729 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:45,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:45,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2019-08-05 11:05:45,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:45,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:05:45,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:45,909 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_50|], 2=[|v_#valid_51|]} [2019-08-05 11:05:45,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:45,958 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 11 treesize of output 13 [2019-08-05 11:05:45,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:46,109 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:05:46,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:46,185 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 38 treesize of output 34 [2019-08-05 11:05:46,186 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:46,557 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-08-05 11:05:46,558 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:05:46,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:46,559 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:05:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:48,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:48,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:05:48,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:05:48,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:05:48,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=1310, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:05:48,773 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 49 states. [2019-08-05 11:05:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:53,323 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:05:53,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:05:53,324 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 92 [2019-08-05 11:05:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:53,325 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:05:53,325 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:05:53,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3248, Invalid=5682, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:05:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:05:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 11:05:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:05:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:05:53,329 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 11:05:53,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:53,329 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:05:53,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:05:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:05:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:05:53,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:53,329 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 11:05:53,330 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:53,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:53,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2019-08-05 11:05:53,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:53,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:05:53,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:53,473 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_51|], 2=[|v_#valid_52|]} [2019-08-05 11:05:53,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:53,493 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 11 treesize of output 13 [2019-08-05 11:05:53,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:53,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:53,518 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 38 treesize of output 34 [2019-08-05 11:05:53,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:53,543 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:05:53,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:53,544 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:05:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:55,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:55,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:05:55,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:05:55,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:05:55,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:05:55,174 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 50 states. [2019-08-05 11:05:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:59,722 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:05:59,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:05:59,722 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2019-08-05 11:05:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:59,723 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:05:59,723 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:05:59,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3389, Invalid=5923, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:05:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:05:59,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 11:05:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:05:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:05:59,727 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 11:05:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:59,727 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:05:59,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:05:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:05:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:05:59,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:59,728 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 11:05:59,728 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:59,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:59,728 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2019-08-05 11:05:59,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:59,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:05:59,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:59,947 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 2=[|v_#valid_53|]} [2019-08-05 11:05:59,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:59,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 11 treesize of output 13 [2019-08-05 11:05:59,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:00,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:00,018 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 23 treesize of output 21 [2019-08-05 11:06:00,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:06:00,456 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 11:06:00,456 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:06:00,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:00,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:06:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:02,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:02,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:06:02,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:06:02,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:06:02,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1415, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:06:02,338 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 51 states. [2019-08-05 11:06:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:07,042 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:06:07,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:06:07,043 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2019-08-05 11:06:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:07,044 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:06:07,044 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:06:07,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3533, Invalid=6169, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:06:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:06:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 11:06:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:06:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:06:07,046 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 11:06:07,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:07,046 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:06:07,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:06:07,046 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:06:07,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:06:07,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:07,047 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 11:06:07,047 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:07,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:07,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2019-08-05 11:06:07,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:07,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:06:07,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:07,203 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_53|], 2=[|v_#valid_54|]} [2019-08-05 11:06:07,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:07,227 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 11 treesize of output 13 [2019-08-05 11:06:07,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:07,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:07,251 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 38 treesize of output 34 [2019-08-05 11:06:07,251 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:07,275 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:06:07,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:07,276 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:06:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:09,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:09,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:06:09,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:06:09,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:06:09,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1183, Invalid=1469, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:06:09,048 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 52 states. [2019-08-05 11:06:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:13,919 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:06:13,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:06:13,920 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2019-08-05 11:06:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:13,921 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:06:13,921 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:06:13,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3680, Invalid=6420, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:06:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:06:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 11:06:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:06:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:06:13,924 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 11:06:13,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:13,925 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:06:13,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:06:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:06:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:06:13,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:13,925 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 11:06:13,926 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:13,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:13,926 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2019-08-05 11:06:13,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:14,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:06:14,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:14,130 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_54|], 2=[|v_#valid_55|]} [2019-08-05 11:06:14,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:14,150 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 11 treesize of output 13 [2019-08-05 11:06:14,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:14,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:14,191 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 23 treesize of output 21 [2019-08-05 11:06:14,192 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:06:14,222 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:06:14,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:14,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:06:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:16,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:16,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:06:16,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:06:16,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:06:16,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=1524, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:06:16,066 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2019-08-05 11:06:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:21,026 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 11:06:21,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:06:21,026 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2019-08-05 11:06:21,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:21,027 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:06:21,027 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:06:21,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3830, Invalid=6676, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:06:21,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:06:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 11:06:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:06:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:06:21,032 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 11:06:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:21,032 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:06:21,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:06:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:06:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:06:21,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:21,033 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 11:06:21,033 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:21,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:21,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2019-08-05 11:06:21,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:21,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:06:21,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:21,189 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 2=[|v_#valid_56|]} [2019-08-05 11:06:21,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,209 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 11 treesize of output 13 [2019-08-05 11:06:21,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:21,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:21,259 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 23 treesize of output 21 [2019-08-05 11:06:21,260 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:06:21,306 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:06:21,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:21,307 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:06:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:23,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:23,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:06:23,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:06:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:06:23,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:06:23,437 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 54 states. [2019-08-05 11:06:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:28,769 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:06:28,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:06:28,770 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2019-08-05 11:06:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:28,771 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:06:28,771 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:06:28,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=3983, Invalid=6937, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:06:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:06:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 11:06:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:06:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:06:28,776 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 11:06:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:28,776 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:06:28,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:06:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:06:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:06:28,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:28,777 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 11:06:28,777 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:28,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:28,778 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2019-08-05 11:06:28,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:28,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:06:28,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:28,991 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_56|], 2=[|v_#valid_57|]} [2019-08-05 11:06:29,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:29,008 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,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,035 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 23 treesize of output 21 [2019-08-05 11:06:29,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:06:29,061 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:06:29,062 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,062 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:06:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:31,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:31,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:06:31,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:06:31,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:06:31,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:06:31,913 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 55 states. [2019-08-05 11:06:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:37,731 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:06:37,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:06:37,732 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 104 [2019-08-05 11:06:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:37,733 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:06:37,734 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:06:37,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=4139, Invalid=7203, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:06:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:06:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-08-05 11:06:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:06:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:06:37,737 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 11:06:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:37,737 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:06:37,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:06:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:06:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:06:37,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:37,738 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 11:06:37,738 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:37,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2019-08-05 11:06:37,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:37,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:06:37,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:37,932 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 2=[|v_#valid_58|]} [2019-08-05 11:06:37,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:37,958 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:37,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:37,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:37,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 38 treesize of output 34 [2019-08-05 11:06:37,993 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:38,027 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:06:38,027 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,028 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:06:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:40,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:40,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:06:40,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:06:40,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:06:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1385, Invalid=1695, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:06:40,696 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 56 states. [2019-08-05 11:06:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:46,689 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:06:46,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:06:46,690 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2019-08-05 11:06:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:46,691 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:06:46,691 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:06:46,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=4298, Invalid=7474, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:06:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:06:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 11:06:46,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:06:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:06:46,695 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 11:06:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:46,695 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:06:46,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:06:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:06:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:06:46,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:46,696 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 11:06:46,697 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:46,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:46,697 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2019-08-05 11:06:46,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:47,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:06:47,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:47,046 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_58|], 2=[|v_#valid_59|]} [2019-08-05 11:06:47,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:47,092 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 11 treesize of output 13 [2019-08-05 11:06:47,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:47,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:47,183 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 38 treesize of output 34 [2019-08-05 11:06:47,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:47,209 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:06:47,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:47,210 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:06:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:49,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:49,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:06:49,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:06:49,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:06:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=1754, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:06:49,284 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 57 states. [2019-08-05 11:06:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:54,973 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 11:06:54,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:06:54,973 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 108 [2019-08-05 11:06:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:54,974 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:06:54,975 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:06:54,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=4460, Invalid=7750, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:06:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:06:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-08-05 11:06:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:06:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 11:06:54,978 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-05 11:06:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:54,978 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 11:06:54,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:06:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 11:06:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:06:54,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:54,979 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-05 11:06:54,979 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:54,979 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2019-08-05 11:06:54,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:55,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:06:55,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:55,193 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_59|], 2=[|v_#valid_60|]} [2019-08-05 11:06:55,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:55,201 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,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:55,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:55,245 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 23 treesize of output 21 [2019-08-05 11:06:55,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:06:55,274 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:06:55,275 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,275 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:06:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:58,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:58,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:06:58,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:06:58,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:06:58,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:06:58,342 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 58 states. [2019-08-05 11:07:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:04,510 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 11:07:04,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:07:04,510 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 110 [2019-08-05 11:07:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:04,511 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:07:04,512 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:07:04,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=4625, Invalid=8031, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:07:04,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:07:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-05 11:07:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:07:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 11:07:04,515 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-05 11:07:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:04,516 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 11:07:04,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:07:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 11:07:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:07:04,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:04,517 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-05 11:07:04,517 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:04,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:04,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2019-08-05 11:07:04,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:04,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:07:04,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:04,786 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_60|], 2=[|v_#valid_61|]} [2019-08-05 11:07:04,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:04,839 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,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:04,985 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:07:04,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:05,062 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 23 treesize of output 21 [2019-08-05 11:07:05,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:07:05,503 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-08-05 11:07:05,504 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:07:05,505 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:05,505 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:07:05,638 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:07:05,812 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:07:06,009 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:07:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:09,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:09,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:07:09,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:07:09,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:07:09,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1547, Invalid=1875, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:07:09,218 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 59 states. [2019-08-05 11:07:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:15,736 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 11:07:15,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:07:15,737 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 112 [2019-08-05 11:07:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:15,738 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:07:15,739 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:07:15,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=4793, Invalid=8317, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:07:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:07:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-08-05 11:07:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:07:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 11:07:15,742 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-05 11:07:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:15,742 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 11:07:15,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:07:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 11:07:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:07:15,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:15,743 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-05 11:07:15,744 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:15,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:15,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2019-08-05 11:07:15,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:15,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:07:15,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:15,994 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_61|], 2=[|v_#valid_62|]} [2019-08-05 11:07:16,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:16,004 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:16,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:16,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:16,039 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 38 treesize of output 34 [2019-08-05 11:07:16,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:16,058 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:07:16,059 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:16,059 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:07:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:19,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:19,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:07:19,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:07:19,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:07:19,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=1937, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:07:19,334 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 60 states. [2019-08-05 11:07:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:26,050 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 11:07:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:07:26,051 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 114 [2019-08-05 11:07:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:26,052 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:07:26,052 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:07:26,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=4964, Invalid=8608, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:07:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:07:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 11:07:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:07:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 11:07:26,056 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-05 11:07:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:26,057 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 11:07:26,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:07:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 11:07:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:07:26,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:26,058 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-05 11:07:26,058 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:26,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:26,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2019-08-05 11:07:26,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:26,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:07:26,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:26,320 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_62|], 2=[|v_#valid_63|]} [2019-08-05 11:07:26,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:26,334 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 11 treesize of output 13 [2019-08-05 11:07:26,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:26,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:26,376 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 32 treesize of output 30 [2019-08-05 11:07:26,377 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:26,400 INFO L567 ElimStorePlain]: treesize reduction 12, result has 68.4 percent of original size [2019-08-05 11:07:26,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:07:26,401 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 Received shutdown request... [2019-08-05 11:07:28,336 WARN L196 SmtUtils]: Removed 2 from assertion stack [2019-08-05 11:07:28,336 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:07:28,337 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:07:28,341 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:07:28,342 INFO L202 PluginConnector]: Adding new model 960521-1_true-valid-memsafety.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:07:28 BoogieIcfgContainer [2019-08-05 11:07:28,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:07:28,343 INFO L168 Benchmark]: Toolchain (without parser) took 243855.25 ms. Allocated memory was 131.6 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 109.0 MB in the beginning and 959.2 MB in the end (delta: -850.2 MB). Peak memory consumption was 168.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:28,343 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 131.6 MB. Free memory was 110.4 MB in the beginning and 110.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:07:28,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.20 ms. Allocated memory is still 131.6 MB. Free memory was 108.7 MB in the beginning and 107.0 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:28,345 INFO L168 Benchmark]: Boogie Preprocessor took 40.16 ms. Allocated memory is still 131.6 MB. Free memory was 107.0 MB in the beginning and 105.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:28,345 INFO L168 Benchmark]: RCFGBuilder took 372.43 ms. Allocated memory is still 131.6 MB. Free memory was 105.7 MB in the beginning and 93.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:28,345 INFO L168 Benchmark]: TraceAbstraction took 243389.16 ms. Allocated memory was 131.6 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 93.0 MB in the beginning and 959.2 MB in the end (delta: -866.2 MB). Peak memory consumption was 152.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:28,346 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 131.6 MB. Free memory was 110.4 MB in the beginning and 110.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.20 ms. Allocated memory is still 131.6 MB. Free memory was 108.7 MB in the beginning and 107.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.16 ms. Allocated memory is still 131.6 MB. Free memory was 107.0 MB in the beginning and 105.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 372.43 ms. Allocated memory is still 131.6 MB. Free memory was 105.7 MB in the beginning and 93.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243389.16 ms. Allocated memory was 131.6 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 93.0 MB in the beginning and 959.2 MB in the end (delta: -866.2 MB). Peak memory consumption was 152.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 116). Cancelled while BasicCegarLoop was analyzing trace of length 117 with TraceHistMax 57,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 18 for 11ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 243.3s OverallTime, 57 OverallIterations, 57 TraceHistogramMax, 151.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 169 SDtfs, 1 SDslu, 392 SDs, 0 SdLazy, 4284 SolverSat, 6320 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4897 GetRequests, 1542 SyntacticMatches, 0 SemanticMatches, 3355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35415 ImplicationChecksByTransitivity, 199.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=56, 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.1s AutomataMinimizationTime, 56 MinimizatonAttempts, 56 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 83.7s InterpolantComputationTime, 3304 NumberOfCodeBlocks, 3304 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 3248 ConstructedInterpolants, 3192 QuantifiedInterpolants, 5052152 SizeOfPredicates, 864 NumberOfNonLiveVariables, 33012 ConjunctsInSsa, 2767 ConjunctsInUnsatCore, 56 InterpolantComputations, 1 PerfectInterpolantSequences, 0/58520 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown