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/standard_strcpy_false-valid-deref_ground.i_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:55:04,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:55:04,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:55:04,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:55:04,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:55:04,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:55:04,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:55:04,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:55:04,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:55:04,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:55:04,596 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:55:04,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:55:04,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:55:04,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:55:04,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:55:04,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:55:04,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:55:04,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:55:04,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:55:04,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:55:04,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:55:04,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:55:04,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:55:04,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:55:04,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:55:04,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:55:04,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:55:04,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:55:04,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:55:04,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:55:04,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:55:04,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:55:04,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:55:04,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:55:04,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:55:04,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:55:04,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:55:04,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:55:04,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:55:04,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:55:04,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:55:04,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:55:04,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:55:04,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:55:04,669 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:55:04,669 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:55:04,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_10.bpl [2019-08-05 10:55:04,670 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_10.bpl' [2019-08-05 10:55:04,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:55:04,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:55:04,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:55:04,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:55:04,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:55:04,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:04" (1/1) ... [2019-08-05 10:55:04,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:04" (1/1) ... [2019-08-05 10:55:04,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:55:04,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:55:04,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:55:04,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:55:04,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:04" (1/1) ... [2019-08-05 10:55:04,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:04" (1/1) ... [2019-08-05 10:55:04,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:04" (1/1) ... [2019-08-05 10:55:04,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:04" (1/1) ... [2019-08-05 10:55:04,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:04" (1/1) ... [2019-08-05 10:55:04,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:04" (1/1) ... [2019-08-05 10:55:04,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:04" (1/1) ... [2019-08-05 10:55:04,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:55:04,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:55:04,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:55:04,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:55:04,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:55:04,836 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:55:04,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:55:04,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:55:05,165 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:55:05,166 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:55:05,167 INFO L202 PluginConnector]: Adding new model standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:55:05 BoogieIcfgContainer [2019-08-05 10:55:05,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:55:05,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:55:05,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:55:05,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:55:05,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:04" (1/2) ... [2019-08-05 10:55:05,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35dcef86 and model type standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:55:05, skipping insertion in model container [2019-08-05 10:55:05,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:55:05" (2/2) ... [2019-08-05 10:55:05,175 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i_10.bpl [2019-08-05 10:55:05,184 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:55:05,191 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:55:05,206 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:55:05,228 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:55:05,229 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:55:05,229 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:55:05,230 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:55:05,230 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:55:05,230 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:55:05,230 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:55:05,230 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:55:05,230 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:55:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:55:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:55:05,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:05,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:55:05,257 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:05,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:05,266 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-08-05 10:55:05,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:05,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:55:05,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:05,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:05,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:05,622 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:55:05,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:05,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:05,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:05,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:55:05,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:55:05,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:55:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:55:05,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:55:05,756 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 10:55:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:05,869 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:55:05,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:55:05,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:55:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:05,880 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:55:05,881 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:55:05,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:55:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:55:05,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:55:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:55:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:55:05,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 10:55:05,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:05,918 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:55:05,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:55:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:55:05,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:55:05,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:05,919 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:55:05,919 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:05,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:05,920 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-08-05 10:55:05,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:06,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:55:06,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:06,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:06,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:06,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:06,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:06,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:06,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:06,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:55:06,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:55:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:55:06,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:55:06,283 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 10:55:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:06,442 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:55:06,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:55:06,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:55:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:06,443 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:55:06,443 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:55:06,444 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 10:55:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:55:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:55:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:55:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:55:06,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 10:55:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:06,447 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:55:06,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:55:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:55:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:55:06,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:06,448 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 10:55:06,448 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2019-08-05 10:55:06,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:06,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:55:06,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:06,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:06,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:06,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:06,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:06,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:06,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:06,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:55:06,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:55:06,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:55:06,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:55:06,900 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 10:55:07,089 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-08-05 10:55:07,355 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-08-05 10:55:07,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:07,688 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:55:07,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:55:07,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:55:07,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:07,690 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:55:07,690 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:55:07,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:55:07,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:55:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:55:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:55:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:55:07,694 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:55:07,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:07,694 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:55:07,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:55:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:55:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:55:07,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:07,695 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 10:55:07,695 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:07,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:07,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2019-08-05 10:55:07,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:07,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:55:07,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:07,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:07,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:07,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:07,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:07,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:08,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:08,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:55:08,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:55:08,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:55:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:55:08,090 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 10:55:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:08,406 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:55:08,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:55:08,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:55:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:08,408 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:55:08,408 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:55:08,409 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 10:55:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:55:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:55:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:55:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:55:08,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:55:08,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:08,412 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:55:08,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:55:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:55:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:55:08,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:08,413 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 10:55:08,413 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:08,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:08,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2019-08-05 10:55:08,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:08,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:55:08,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:08,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:08,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:08,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:08,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:08,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:08,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:08,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:55:08,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:55:08,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:55:08,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:55:08,806 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-08-05 10:55:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:09,207 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:55:09,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:55:09,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 10:55:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:09,209 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:55:09,209 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:55:09,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:55:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:55:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 10:55:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:55:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:55:09,212 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:55:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:09,213 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:55:09,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:55:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:55:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:55:09,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:09,214 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 10:55:09,214 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:09,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:09,214 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2019-08-05 10:55:09,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:09,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:55:09,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:09,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:09,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:09,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:09,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:09,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:09,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:09,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:55:09,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:55:09,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:55:09,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:55:09,705 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2019-08-05 10:55:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:10,099 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:55:10,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:55:10,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 10:55:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:10,101 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:55:10,102 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:55:10,103 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 10:55:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:55:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:55:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:55:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:55:10,106 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:55:10,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:10,106 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:55:10,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:55:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:55:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:55:10,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:10,107 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 10:55:10,107 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:10,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:10,108 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2019-08-05 10:55:10,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:10,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:55:10,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:10,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:10,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:10,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:10,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:10,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:10,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:10,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:55:10,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:55:10,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:55:10,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:55:10,485 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2019-08-05 10:55:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:10,832 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:55:10,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:55:10,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-05 10:55:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:10,833 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:55:10,833 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:55:10,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:55:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:55:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 10:55:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:55:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:55:10,837 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 10:55:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:10,837 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:55:10,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:55:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:55:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:55:10,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:10,838 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 10:55:10,838 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:10,839 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2019-08-05 10:55:10,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:10,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:55:10,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:10,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:10,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:10,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:10,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:10,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:11,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:11,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:55:11,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:55:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:55:11,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:55:11,177 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-08-05 10:55:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:11,647 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:55:11,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:55:11,649 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 10:55:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:11,650 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:55:11,650 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:55:11,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:55:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:55:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 10:55:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:55:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:55:11,654 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 10:55:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:11,654 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:55:11,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:55:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:55:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:55:11,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:11,655 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 10:55:11,655 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2019-08-05 10:55:11,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:11,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:55:11,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:11,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:11,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:11,896 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:55:11,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:11,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:11,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:12,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:12,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:55:12,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:55:12,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:55:12,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:55:12,245 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2019-08-05 10:55:12,753 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 10:55:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:12,876 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:55:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:55:12,879 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-05 10:55:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:12,879 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:55:12,880 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:55:12,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:55:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:55:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 10:55:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:55:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:55:12,883 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 10:55:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:12,884 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:55:12,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:55:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:55:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:55:12,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:12,885 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 10:55:12,885 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2019-08-05 10:55:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:13,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:55:13,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:13,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:13,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:13,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:13,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:13,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:13,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:13,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:55:13,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:55:13,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:55:13,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:55:13,603 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2019-08-05 10:55:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:14,179 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:55:14,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:55:14,179 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 10:55:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:14,180 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:55:14,180 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:55:14,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:55:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:55:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 10:55:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:55:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:55:14,185 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 10:55:14,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:14,185 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:55:14,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:55:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:55:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:55:14,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:14,186 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 10:55:14,186 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:14,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:14,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2019-08-05 10:55:14,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:14,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:55:14,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:14,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:14,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:14,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:14,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:14,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:14,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:14,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:55:14,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:55:14,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:55:14,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:55:14,769 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 15 states. [2019-08-05 10:55:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:15,424 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:55:15,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:55:15,425 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-08-05 10:55:15,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:15,426 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:55:15,426 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:55:15,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:55:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:55:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 10:55:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:55:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:55:15,430 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 10:55:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:15,431 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:55:15,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:55:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:55:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:55:15,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:15,432 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 10:55:15,432 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:15,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:15,432 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2019-08-05 10:55:15,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:15,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:55:15,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:15,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:15,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:15,749 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:55:15,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:15,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:15,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:16,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:16,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:55:16,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:55:16,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:55:16,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:55:16,051 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 16 states. [2019-08-05 10:55:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:16,693 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:55:16,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:55:16,694 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 10:55:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:16,695 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:55:16,695 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:55:16,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:55:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:55:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 10:55:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:55:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:55:16,699 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 10:55:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:16,700 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:55:16,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:55:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:55:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:55:16,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:16,701 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 10:55:16,701 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:16,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:16,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2019-08-05 10:55:16,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:16,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:55:16,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:16,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:16,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:16,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:16,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:16,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:17,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:17,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:55:17,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:55:17,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:55:17,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:55:17,234 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2019-08-05 10:55:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:18,037 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:55:18,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:55:18,038 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 10:55:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:18,039 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:55:18,039 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:55:18,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:55:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:55:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 10:55:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:55:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:55:18,044 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 10:55:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:18,044 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:55:18,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:55:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:55:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:55:18,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:18,045 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 10:55:18,046 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:18,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:18,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2019-08-05 10:55:18,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:18,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:55:18,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:18,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:18,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:18,339 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:55:18,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:18,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:18,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:55:18,784 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:55:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:19,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:19,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:55:19,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:55:19,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:55:19,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:55:19,076 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2019-08-05 10:55:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:20,116 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:55:20,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:55:20,117 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 10:55:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:20,117 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:55:20,118 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:55:20,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:55:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:55:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 10:55:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:55:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:55:20,122 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 10:55:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:20,122 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:55:20,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:55:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:55:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:55:20,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:20,123 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 10:55:20,123 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2019-08-05 10:55:20,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:20,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:55:20,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:20,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:20,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:20,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:20,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:20,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:55:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:20,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:20,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:55:20,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:55:20,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:55:20,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:55:20,813 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 19 states. [2019-08-05 10:55:21,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:21,851 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:55:21,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:55:21,851 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 10:55:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:21,852 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:55:21,853 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:55:21,854 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 10:55:21,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:55:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 10:55:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:55:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:55:21,857 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 10:55:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:21,857 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:55:21,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:55:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:55:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:55:21,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:21,858 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 10:55:21,859 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:21,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:21,859 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2019-08-05 10:55:21,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:22,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:55:22,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:22,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:22,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:22,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:22,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:22,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:55:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:22,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:22,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:55:22,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:55:22,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:55:22,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:55:22,557 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 20 states. [2019-08-05 10:55:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:23,521 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:55:23,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:55:23,524 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 10:55:23,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:23,524 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:55:23,524 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:55:23,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:55:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:55:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 10:55:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:55:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:55:23,528 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 10:55:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:23,528 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:55:23,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:55:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:55:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:55:23,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:23,529 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 10:55:23,530 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:23,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:23,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2019-08-05 10:55:23,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:24,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:55:24,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:24,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:24,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:24,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:24,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:24,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:55:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:25,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:25,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:55:25,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:55:25,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:55:25,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:55:25,046 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 21 states. [2019-08-05 10:55:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:26,066 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:55:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:55:26,066 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 10:55:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:26,067 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:55:26,067 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:55:26,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:55:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:55:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 10:55:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:55:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:55:26,072 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 10:55:26,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:26,073 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:55:26,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:55:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:55:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:55:26,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:26,074 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 10:55:26,074 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:26,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2019-08-05 10:55:26,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:27,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:55:27,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:27,060 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_7|], 2=[|v_#valid_7|]} [2019-08-05 10:55:27,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:55:27,108 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 10:55:27,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:27,251 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:55:27,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:27,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 10:55:27,342 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:27,647 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-08-05 10:55:27,647 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 10:55:27,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:27,648 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 10:55:27,803 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:55:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:28,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:28,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:55:28,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:55:28,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:55:28,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:55:28,703 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 23 states. [2019-08-05 10:55:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:30,365 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:55:30,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:55:30,365 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2019-08-05 10:55:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:30,366 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:55:30,366 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:55:30,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=597, Invalid=1125, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:55:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:55:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 10:55:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:55:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:55:30,371 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 10:55:30,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:30,371 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:55:30,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:55:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:55:30,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:55:30,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:30,373 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 10:55:30,373 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:30,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:30,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2019-08-05 10:55:30,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:30,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:55:30,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:30,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:30,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:30,683 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:55:30,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:30,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:30,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:31,472 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:55:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:31,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:31,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:55:31,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:55:31,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:55:31,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:55:31,493 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 23 states. [2019-08-05 10:55:32,165 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-08-05 10:55:33,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:33,053 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:55:33,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:55:33,053 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 10:55:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:33,054 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:55:33,054 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:55:33,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:55:33,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:55:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 10:55:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:55:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:55:33,059 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 10:55:33,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:33,059 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:55:33,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:55:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:55:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:55:33,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:33,060 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 10:55:33,060 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:33,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:33,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2019-08-05 10:55:33,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:33,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:55:33,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:33,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:33,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:33,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:33,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:33,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:55:33,817 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:55:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:34,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:34,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:55:34,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:55:34,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:55:34,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:55:34,191 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 24 states. [2019-08-05 10:55:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:35,723 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:55:35,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:55:35,724 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 10:55:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:35,725 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:55:35,725 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:55:35,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=698, Invalid=1282, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:55:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:55:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 10:55:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:55:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:55:35,730 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 10:55:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:35,731 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:55:35,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:55:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:55:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:55:35,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:35,732 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 10:55:35,732 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2019-08-05 10:55:35,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:35,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:55:35,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:36,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:36,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:36,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:36,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:36,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:36,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:36,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:55:36,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:55:36,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:55:36,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:55:36,487 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 25 states. [2019-08-05 10:55:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:37,801 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:55:37,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:55:37,803 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 10:55:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:37,803 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:55:37,803 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:55:37,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:55:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:55:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 10:55:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:55:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:55:37,808 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 10:55:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:37,808 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:55:37,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:55:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:55:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:55:37,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:37,809 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 10:55:37,809 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2019-08-05 10:55:37,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:38,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:55:38,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:38,858 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_8|], 2=[|v_#valid_8|]} [2019-08-05 10:55:38,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:55:38,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:55:38,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:38,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:38,919 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 10:55:38,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:38,937 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 10:55:38,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:38,938 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 10:55:39,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-08-05 10:55:39,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:39,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:39,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:55:39,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2019-08-05 10:55:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:39,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:39,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:55:39,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:55:39,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:55:39,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:55:39,860 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 30 states. [2019-08-05 10:55:41,213 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-08-05 10:55:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:42,458 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:55:42,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:55:42,461 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2019-08-05 10:55:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:42,462 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:55:42,462 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:55:42,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=831, Invalid=2031, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:55:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:55:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:55:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:55:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:55:42,466 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 10:55:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:42,466 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:55:42,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:55:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:55:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:55:42,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:42,467 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 10:55:42,467 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2019-08-05 10:55:42,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:42,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:55:42,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:42,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:42,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:42,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:42,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:42,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:55:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:43,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:43,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:55:43,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:55:43,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:55:43,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=419, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:55:43,286 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 27 states. [2019-08-05 10:55:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:44,726 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:55:44,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:55:44,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 10:55:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:44,737 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:55:44,737 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:55:44,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=905, Invalid=1645, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:55:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:55:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 10:55:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:55:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:55:44,740 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 10:55:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:44,741 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:55:44,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:55:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:55:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:55:44,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:44,742 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 10:55:44,742 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2019-08-05 10:55:44,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:44,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:55:44,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:44,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:44,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:45,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:45,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:45,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:55:45,687 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:55:45,900 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:55:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:46,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:46,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:55:46,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:55:46,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:55:46,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:55:46,378 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 28 states. [2019-08-05 10:55:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:47,905 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:55:47,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:55:47,905 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 10:55:47,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:47,906 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:55:47,906 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:55:47,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=980, Invalid=1776, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:55:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:55:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 10:55:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:55:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:55:47,910 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 10:55:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:47,910 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:55:47,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:55:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:55:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:55:47,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:47,911 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 10:55:47,911 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:47,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:47,911 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2019-08-05 10:55:47,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:48,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:55:48,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:48,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:48,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:48,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:48,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:48,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:55:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:49,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:49,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:55:49,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:55:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:55:49,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=480, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:55:49,611 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 29 states. [2019-08-05 10:55:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:51,357 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:55:51,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:55:51,357 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 10:55:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:51,358 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:55:51,358 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:55:51,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1058, Invalid=1912, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:55:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:55:51,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 10:55:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:55:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:55:51,364 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 10:55:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:51,364 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:55:51,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:55:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:55:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:55:51,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:51,365 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 10:55:51,365 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:51,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2019-08-05 10:55:51,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:51,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:55:51,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:51,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:51,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:51,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:51,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:51,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:55:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:52,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:52,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:55:52,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:55:52,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:55:52,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:55:52,713 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 30 states. [2019-08-05 10:55:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:54,363 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:55:54,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:55:54,365 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 10:55:54,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:54,366 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:55:54,366 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:55:54,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1139, Invalid=2053, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:55:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:55:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 10:55:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:55:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:55:54,370 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 10:55:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:54,370 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:55:54,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:55:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:55:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:55:54,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:54,371 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 10:55:54,371 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:54,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2019-08-05 10:55:54,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:55,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:55:55,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:55,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:55,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:55,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:55,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:55:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:56,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:56,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:55:56,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:55:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:55:56,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=545, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:55:56,259 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 31 states. [2019-08-05 10:55:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:58,095 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:55:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:55:58,096 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2019-08-05 10:55:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:58,097 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:55:58,097 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:55:58,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1223, Invalid=2199, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:55:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:55:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 10:55:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:55:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:55:58,102 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 10:55:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:58,102 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:55:58,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:55:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:55:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:55:58,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:58,103 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 10:55:58,103 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:58,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:58,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2019-08-05 10:55:58,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:58,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:55:58,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:58,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:55:58,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:58,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:58,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:55:58,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:55:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:59,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:59,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:55:59,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:55:59,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:55:59,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=579, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:55:59,261 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 32 states. [2019-08-05 10:56:00,506 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 10:56:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:01,272 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:56:01,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:56:01,272 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2019-08-05 10:56:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:01,273 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:56:01,273 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:56:01,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1310, Invalid=2350, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:56:01,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:56:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 10:56:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:56:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:56:01,278 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 10:56:01,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:01,278 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:56:01,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:56:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:56:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:56:01,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:01,279 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 10:56:01,279 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:01,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:01,280 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2019-08-05 10:56:01,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:01,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:56:01,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:01,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:01,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:01,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:01,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:01,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:02,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:02,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:56:02,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:56:02,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:56:02,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=614, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:56:02,414 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 33 states. [2019-08-05 10:56:04,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:04,386 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:56:04,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:56:04,386 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 60 [2019-08-05 10:56:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:04,387 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:56:04,387 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:56:04,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:56:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:56:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 10:56:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:56:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:56:04,391 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 10:56:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:04,392 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:56:04,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:56:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:56:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:56:04,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:04,392 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 10:56:04,393 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:04,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2019-08-05 10:56:04,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:04,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:56:04,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:04,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:04,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:04,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:04,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:04,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:05,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:05,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:56:05,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:56:05,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:56:05,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:56:05,629 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 34 states. [2019-08-05 10:56:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:07,882 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:56:07,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:56:07,882 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-08-05 10:56:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:07,883 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:56:07,883 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:56:07,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1493, Invalid=2667, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:56:07,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:56:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 10:56:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:56:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:56:07,887 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 10:56:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:07,887 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:56:07,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:56:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:56:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:56:07,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:07,888 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 10:56:07,888 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2019-08-05 10:56:07,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:08,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:56:08,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:08,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:08,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:08,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:08,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:08,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:08,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:08,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:56:08,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:56:08,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:56:08,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=687, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:56:08,825 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 35 states. [2019-08-05 10:56:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:11,040 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:56:11,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:56:11,040 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 64 [2019-08-05 10:56:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:11,041 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:56:11,041 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:56:11,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1589, Invalid=2833, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:56:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:56:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 10:56:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:56:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:56:11,045 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 10:56:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:11,045 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:56:11,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:56:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:56:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:56:11,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:11,046 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 10:56:11,046 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:11,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:11,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2019-08-05 10:56:11,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:11,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:56:11,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:11,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:11,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:11,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:11,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:11,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:12,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:12,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:56:12,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:56:12,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:56:12,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=725, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:56:12,007 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2019-08-05 10:56:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:14,211 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:56:14,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:56:14,211 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2019-08-05 10:56:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:14,212 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:56:14,212 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:56:14,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1688, Invalid=3004, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:56:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:56:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 10:56:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:56:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:56:14,216 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 10:56:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:14,216 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:56:14,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:56:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:56:14,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:56:14,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:14,217 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 10:56:14,217 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:14,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:14,218 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2019-08-05 10:56:14,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:15,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:56:15,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:15,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:15,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:15,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:15,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:15,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:16,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:16,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:56:16,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:56:16,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:56:16,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=764, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:56:16,996 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 37 states. [2019-08-05 10:56:19,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:19,449 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:56:19,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:56:19,450 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2019-08-05 10:56:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:19,451 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:56:19,451 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:56:19,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1790, Invalid=3180, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:56:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:56:19,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 10:56:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:56:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:56:19,455 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 10:56:19,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:19,455 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:56:19,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:56:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:56:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:56:19,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:19,456 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 10:56:19,456 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:19,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:19,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2019-08-05 10:56:19,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:20,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:56:20,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:20,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:20,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:20,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:20,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:20,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:20,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:20,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:56:20,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:56:20,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:56:20,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:56:20,986 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 38 states. [2019-08-05 10:56:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:23,679 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:56:23,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:56:23,680 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2019-08-05 10:56:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:23,681 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:56:23,681 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:56:23,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1895, Invalid=3361, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:56:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:56:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 10:56:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:56:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:56:23,684 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 10:56:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:23,684 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:56:23,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:56:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:56:23,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:56:23,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:23,685 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 10:56:23,686 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:23,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:23,686 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2019-08-05 10:56:23,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:23,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 1319 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:56:23,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:23,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:23,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:24,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:24,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:24,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:24,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:24,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:56:24,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:56:24,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:56:24,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=845, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:56:24,996 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 39 states. [2019-08-05 10:56:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:27,690 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:56:27,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:56:27,691 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2019-08-05 10:56:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:27,692 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:56:27,692 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:56:27,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2003, Invalid=3547, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:56:27,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:56:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 10:56:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:56:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:56:27,696 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 10:56:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:27,696 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:56:27,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:56:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:56:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:56:27,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:27,697 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 10:56:27,697 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:27,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:27,697 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2019-08-05 10:56:27,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:28,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:56:28,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:28,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:28,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:28,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:28,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:28,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:29,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:29,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:56:29,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:56:29,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:56:29,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=887, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:56:29,095 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 40 states. [2019-08-05 10:56:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:31,863 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:56:31,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:56:31,869 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-08-05 10:56:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:31,870 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:56:31,870 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:56:31,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2114, Invalid=3738, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:56:31,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:56:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 10:56:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:56:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:56:31,873 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 10:56:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:31,873 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:56:31,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:56:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:56:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:56:31,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:31,874 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 10:56:31,874 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2019-08-05 10:56:31,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:32,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:56:32,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:32,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:32,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:32,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:32,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:32,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:33,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:33,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:56:33,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:56:33,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:56:33,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=930, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:56:33,031 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 41 states. [2019-08-05 10:56:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:35,823 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:56:35,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:56:35,824 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2019-08-05 10:56:35,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:35,825 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:56:35,825 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:56:35,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2228, Invalid=3934, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:56:35,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:56:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 10:56:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:56:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:56:35,829 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 10:56:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:35,829 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:56:35,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:56:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:56:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:56:35,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:35,830 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 10:56:35,830 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:35,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:35,830 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2019-08-05 10:56:35,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:38,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:56:38,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:38,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:38,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:38,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:38,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:38,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:39,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:39,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:56:39,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:56:39,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:56:39,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:56:39,474 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 42 states. [2019-08-05 10:56:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:42,524 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:56:42,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:56:42,524 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2019-08-05 10:56:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:42,525 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:56:42,525 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:56:42,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2345, Invalid=4135, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:56:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:56:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 10:56:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:56:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:56:42,529 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 10:56:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:42,530 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:56:42,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:56:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:56:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:56:42,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:42,531 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 10:56:42,531 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:42,531 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2019-08-05 10:56:42,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:42,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:56:42,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:42,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:42,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:42,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:42,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:42,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:43,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:43,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:56:43,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:56:43,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:56:43,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:56:43,795 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 43 states. [2019-08-05 10:56:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:47,173 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:56:47,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:56:47,174 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 80 [2019-08-05 10:56:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:47,175 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:56:47,175 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:56:47,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2465, Invalid=4341, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:56:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:56:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 10:56:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:56:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:56:47,179 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 10:56:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:47,179 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:56:47,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:56:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:56:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:56:47,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:47,180 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 10:56:47,180 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:47,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:47,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2019-08-05 10:56:47,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:48,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:56:48,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:48,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:48,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:48,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:48,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:48,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:49,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:49,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:56:49,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:56:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:56:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=1065, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:56:49,616 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 44 states. [2019-08-05 10:56:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:52,944 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:56:52,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:56:52,945 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2019-08-05 10:56:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:52,946 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:56:52,946 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:56:52,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2588, Invalid=4552, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:56:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:56:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 10:56:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:56:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:56:52,950 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 10:56:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:52,950 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:56:52,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:56:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:56:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:56:52,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:52,951 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 10:56:52,951 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:52,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:52,951 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2019-08-05 10:56:52,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:54,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:56:54,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:54,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:54,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:54,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:54,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:54,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:56:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:55,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:55,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:56:55,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:56:55,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:56:55,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=1112, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:56:55,503 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 45 states. [2019-08-05 10:56:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:58,985 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:56:58,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:56:58,985 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2019-08-05 10:56:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:58,986 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:56:58,986 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:56:58,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2714, Invalid=4768, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:56:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:56:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 10:56:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:56:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:56:58,990 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 10:56:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:58,990 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:56:58,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:56:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:56:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:56:58,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:58,991 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 10:56:58,991 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:58,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2019-08-05 10:56:58,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:59,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:56:59,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:59,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:59,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:59,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:59,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:59,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:57:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:01,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:01,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:57:01,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:57:01,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:57:01,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:57:01,187 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 46 states. [2019-08-05 10:57:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:04,697 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:57:04,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:57:04,697 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2019-08-05 10:57:04,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:04,698 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:57:04,699 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:57:04,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2843, Invalid=4989, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:57:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:57:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 10:57:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:57:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:57:04,702 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 10:57:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:04,702 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:57:04,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:57:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:57:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:57:04,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:04,703 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 10:57:04,703 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:04,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:04,703 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2019-08-05 10:57:04,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:05,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:57:05,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:05,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:05,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:05,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:05,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:05,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:57:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:06,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:06,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:57:06,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:57:06,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:57:06,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1209, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:57:06,483 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 47 states. [2019-08-05 10:57:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:09,936 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:57:09,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:57:09,936 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 88 [2019-08-05 10:57:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:09,937 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:57:09,937 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:57:09,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2975, Invalid=5215, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:57:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:57:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 10:57:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:57:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:57:09,941 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 10:57:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:09,941 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:57:09,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:57:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:57:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:57:09,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:09,942 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 10:57:09,942 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2019-08-05 10:57:09,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:10,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:57:10,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:10,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:10,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:10,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:10,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:10,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:57:10,767 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:57:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:12,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:12,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:57:12,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:57:12,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:57:12,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=997, Invalid=1259, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:57:12,240 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 48 states. [2019-08-05 10:57:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:15,967 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:57:15,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:57:15,967 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2019-08-05 10:57:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:15,968 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:57:15,968 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:57:15,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3110, Invalid=5446, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:57:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:57:15,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 10:57:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:57:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:57:15,971 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 10:57:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:15,971 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:57:15,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:57:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:57:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:57:15,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:15,972 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 10:57:15,972 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:15,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:15,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2019-08-05 10:57:15,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:16,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1689 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:57:16,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:16,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:16,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:16,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:16,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:16,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:57:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:18,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:18,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:57:18,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:57:18,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:57:18,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=1310, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:57:18,039 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 49 states. [2019-08-05 10:57:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:21,700 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:57:21,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:57:21,701 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 92 [2019-08-05 10:57:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:21,702 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:57:21,702 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:57:21,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3248, Invalid=5682, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:57:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:57:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 10:57:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:57:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:57:21,706 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 10:57:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:21,707 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:57:21,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:57:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:57:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:57:21,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:21,707 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 10:57:21,708 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2019-08-05 10:57:21,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:23,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1726 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:57:23,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:23,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:23,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:23,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:23,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:23,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:57:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:24,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:24,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:57:24,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:57:24,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:57:24,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:57:24,606 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 50 states. [2019-08-05 10:57:24,877 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-08-05 10:57:25,231 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-08-05 10:57:25,768 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 10:57:29,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:29,143 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:57:29,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:57:29,144 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2019-08-05 10:57:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:29,145 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:57:29,145 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:57:29,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3389, Invalid=5923, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:57:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:57:29,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 10:57:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:57:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:57:29,148 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 10:57:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:29,149 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:57:29,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:57:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:57:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:57:29,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:29,149 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 10:57:29,150 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:29,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:29,150 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2019-08-05 10:57:29,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:29,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 1763 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:57:29,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:29,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:29,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:29,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:29,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:29,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:57:31,077 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:57:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:31,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:31,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:57:31,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:57:31,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:57:31,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1415, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:57:31,100 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 51 states. [2019-08-05 10:57:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:35,091 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:57:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:57:35,092 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2019-08-05 10:57:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:35,093 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:57:35,093 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:57:35,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3533, Invalid=6169, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:57:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:57:35,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 10:57:35,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:57:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:57:35,097 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 10:57:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:35,097 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:57:35,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:57:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:57:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:57:35,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:35,098 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 10:57:35,098 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:35,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2019-08-05 10:57:35,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:35,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 1800 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:57:35,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:35,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:35,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:35,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:35,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:35,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:57:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:37,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:37,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:57:37,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:57:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:57:37,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1183, Invalid=1469, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:57:37,150 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 52 states. [2019-08-05 10:57:41,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:41,320 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:57:41,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:57:41,320 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2019-08-05 10:57:41,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:41,321 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:57:41,322 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:57:41,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3680, Invalid=6420, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:57:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:57:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 10:57:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:57:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:57:41,326 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 10:57:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:41,326 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:57:41,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:57:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:57:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:57:41,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:41,327 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 10:57:41,327 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:41,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:41,327 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2019-08-05 10:57:41,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:41,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:57:41,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:41,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:41,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:41,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:41,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:41,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:57:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:43,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:43,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:57:43,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:57:43,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:57:43,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=1524, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:57:43,725 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2019-08-05 10:57:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:47,912 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:57:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:57:47,913 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2019-08-05 10:57:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:47,914 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:57:47,914 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:57:47,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3830, Invalid=6676, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:57:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:57:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 10:57:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:57:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:57:47,917 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 10:57:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:47,918 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:57:47,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:57:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:57:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:57:47,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:47,919 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 10:57:47,919 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2019-08-05 10:57:47,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:50,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1874 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:57:50,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:50,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:50,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:50,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:50,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:50,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:57:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:51,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:51,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:57:51,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:57:51,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:57:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:57:51,853 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 54 states. [2019-08-05 10:57:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:56,429 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:57:56,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:57:56,429 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2019-08-05 10:57:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:56,431 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:57:56,431 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:57:56,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3983, Invalid=6937, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:57:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:57:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 10:57:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:57:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:57:56,435 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 10:57:56,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:56,436 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:57:56,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:57:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:57:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:57:56,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:56,437 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 10:57:56,437 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:56,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:56,437 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2019-08-05 10:57:56,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:57,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:57:57,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:57,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:57,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:57,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:57,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:57,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:57:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:59,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:59,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:57:59,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:57:59,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:57:59,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:57:59,547 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 55 states. [2019-08-05 10:58:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:04,034 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:58:04,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:58:04,035 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 104 [2019-08-05 10:58:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:04,036 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:58:04,037 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:58:04,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4139, Invalid=7203, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:58:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:58:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-08-05 10:58:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:58:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:58:04,040 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 10:58:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:04,040 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:58:04,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:58:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:58:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:58:04,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:04,041 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 10:58:04,042 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:04,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2019-08-05 10:58:04,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:04,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 1948 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:58:04,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:04,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:58:04,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:58:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:06,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:06,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:58:06,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:58:06,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:58:06,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1385, Invalid=1695, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:58:06,192 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 56 states. [2019-08-05 10:58:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:10,995 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:58:10,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:58:10,995 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2019-08-05 10:58:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:10,996 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:58:10,996 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:58:10,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4298, Invalid=7474, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:58:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:58:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 10:58:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:58:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:58:11,000 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 10:58:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:11,001 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:58:11,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:58:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:58:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:58:11,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:11,002 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 10:58:11,002 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:11,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:11,002 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2019-08-05 10:58:11,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:11,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 1985 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:58:11,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:11,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:58:11,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:11,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:58:13,438 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 10:58:13,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:13,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:58:13,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:58:13,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:58:13,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=1754, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:58:13,440 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 57 states. [2019-08-05 10:58:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:18,272 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:58:18,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:58:18,272 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 108 [2019-08-05 10:58:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:18,273 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:58:18,273 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:58:18,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4460, Invalid=7750, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:58:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:58:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-08-05 10:58:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:58:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:58:18,278 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-05 10:58:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:18,278 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:58:18,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:58:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:58:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:58:18,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:18,279 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-05 10:58:18,279 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:18,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:18,279 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2019-08-05 10:58:18,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:18,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 2022 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:58:18,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:18,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:58:18,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:18,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:18,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:18,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:58:20,853 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 10:58:20,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:20,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:58:20,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:58:20,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:58:20,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:58:20,854 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 58 states. [2019-08-05 10:58:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:25,832 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:58:25,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:58:25,833 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 110 [2019-08-05 10:58:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:25,834 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:58:25,834 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:58:25,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4625, Invalid=8031, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:58:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:58:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-05 10:58:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:58:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:58:25,838 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-05 10:58:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:25,838 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:58:25,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:58:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:58:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:58:25,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:25,839 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-05 10:58:25,839 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:25,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:25,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2019-08-05 10:58:25,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:32,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 2059 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:58:32,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:32,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:58:32,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:32,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:32,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:32,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:58:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:34,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:34,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:58:34,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:58:34,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:58:34,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1547, Invalid=1875, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:58:34,186 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 59 states. [2019-08-05 10:58:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:39,527 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:58:39,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:58:39,528 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 112 [2019-08-05 10:58:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:39,529 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:58:39,529 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:58:39,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4793, Invalid=8317, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:58:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:58:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-08-05 10:58:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:58:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:58:39,534 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-05 10:58:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:39,534 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:58:39,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:58:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:58:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:58:39,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:39,535 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-05 10:58:39,535 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:39,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:39,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2019-08-05 10:58:39,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:40,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 2096 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:58:40,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:40,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:58:40,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:40,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:58:42,104 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 10:58:42,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:42,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:58:42,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:58:42,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:58:42,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=1937, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:58:42,106 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 60 states. [2019-08-05 10:58:47,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:47,396 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:58:47,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:58:47,398 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 114 [2019-08-05 10:58:47,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:47,399 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:58:47,399 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:58:47,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4964, Invalid=8608, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:58:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:58:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 10:58:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:58:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:58:47,402 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-05 10:58:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:47,403 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:58:47,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:58:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:58:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:58:47,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:47,404 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-05 10:58:47,404 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:47,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:47,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2019-08-05 10:58:47,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:52,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 2133 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:58:52,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:52,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:58:52,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:52,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:52,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:52,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 10:58:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:54,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:54,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:58:54,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:58:54,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:58:54,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1660, Invalid=2000, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:58:54,371 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 61 states. [2019-08-05 10:58:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:59,880 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:58:59,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:58:59,881 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 116 [2019-08-05 10:58:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:59,881 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:58:59,881 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:58:59,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1820 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5138, Invalid=8904, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:58:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:58:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-08-05 10:58:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:58:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:58:59,884 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-08-05 10:58:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:59,885 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:58:59,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:58:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:58:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:58:59,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:59,886 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2019-08-05 10:58:59,886 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:59,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:59,886 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2019-08-05 10:58:59,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:09,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 2170 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:59:09,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:09,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:59:09,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:09,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:09,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:59:09,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 Received shutdown request... [2019-08-05 10:59:10,304 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:59:10,304 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:59:10,308 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:59:10,308 INFO L202 PluginConnector]: Adding new model standard_strcpy_false-valid-deref_ground.i_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:59:10 BoogieIcfgContainer [2019-08-05 10:59:10,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:59:10,309 INFO L168 Benchmark]: Toolchain (without parser) took 245597.28 ms. Allocated memory was 134.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 111.4 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-08-05 10:59:10,310 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory is still 112.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:59:10,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.18 ms. Allocated memory is still 134.2 MB. Free memory was 111.4 MB in the beginning and 109.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:10,310 INFO L168 Benchmark]: Boogie Preprocessor took 24.25 ms. Allocated memory is still 134.2 MB. Free memory was 109.6 MB in the beginning and 108.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:10,310 INFO L168 Benchmark]: RCFGBuilder took 392.75 ms. Allocated memory is still 134.2 MB. Free memory was 108.3 MB in the beginning and 96.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:10,311 INFO L168 Benchmark]: TraceAbstraction took 245139.53 ms. Allocated memory was 134.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 95.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-08-05 10:59:10,312 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.20 ms. Allocated memory is still 134.2 MB. Free memory is still 112.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.18 ms. Allocated memory is still 134.2 MB. Free memory was 111.4 MB in the beginning and 109.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.25 ms. Allocated memory is still 134.2 MB. Free memory was 109.6 MB in the beginning and 108.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.75 ms. Allocated memory is still 134.2 MB. Free memory was 108.3 MB in the beginning and 96.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245139.53 ms. Allocated memory was 134.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 95.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 108). Cancelled while BasicCegarLoop was analyzing trace of length 119 with TraceHistMax 58,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 245.0s OverallTime, 58 OverallIterations, 58 TraceHistogramMax, 135.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 171 SDtfs, 60 SDslu, 461 SDs, 0 SdLazy, 4556 SolverSat, 6496 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5071 GetRequests, 1593 SyntacticMatches, 0 SemanticMatches, 3478 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37473 ImplicationChecksByTransitivity, 170.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=57, 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, 57 MinimizatonAttempts, 57 StatesRemovedByMinimization, 57 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 36.3s SatisfiabilityAnalysisTime, 61.7s InterpolantComputationTime, 3420 NumberOfCodeBlocks, 3420 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 3363 ConstructedInterpolants, 127 QuantifiedInterpolants, 3210555 SizeOfPredicates, 730 NumberOfNonLiveVariables, 62529 ConjunctsInSsa, 2649 ConjunctsInUnsatCore, 57 InterpolantComputations, 1 PerfectInterpolantSequences, 0/61712 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown