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/20170319-ConjunctivePathPrograms/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:48:13,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:48:13,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:48:13,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:48:13,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:48:13,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:48:13,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:48:13,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:48:13,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:48:13,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:48:13,367 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:48:13,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:48:13,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:48:13,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:48:13,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:48:13,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:48:13,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:48:13,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:48:13,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:48:13,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:48:13,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:48:13,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:48:13,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:48:13,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:48:13,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:48:13,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:48:13,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:48:13,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:48:13,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:48:13,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:48:13,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:48:13,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:48:13,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:48:13,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:48:13,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:48:13,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:48:13,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:48:13,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:48:13,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:48:13,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:48:13,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:48:13,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:48:13,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:48:13,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:48:13,478 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:48:13,479 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:48:13,479 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:48:13,480 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl' [2019-08-05 10:48:13,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:48:13,521 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:48:13,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:48:13,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:48:13,522 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:48:13,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:13" (1/1) ... [2019-08-05 10:48:13,550 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:13" (1/1) ... [2019-08-05 10:48:13,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:48:13,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:48:13,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:48:13,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:48:13,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:13" (1/1) ... [2019-08-05 10:48:13,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:13" (1/1) ... [2019-08-05 10:48:13,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:13" (1/1) ... [2019-08-05 10:48:13,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:13" (1/1) ... [2019-08-05 10:48:13,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:13" (1/1) ... [2019-08-05 10:48:13,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:13" (1/1) ... [2019-08-05 10:48:13,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:13" (1/1) ... [2019-08-05 10:48:13,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:48:13,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:48:13,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:48:13,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:48:13,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:48:13,667 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:48:13,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:48:13,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:48:13,937 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:48:13,937 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:48:13,938 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:48:13 BoogieIcfgContainer [2019-08-05 10:48:13,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:48:13,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:48:13,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:48:13,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:48:13,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:13" (1/2) ... [2019-08-05 10:48:13,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a89b0e2 and model type gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:48:13, skipping insertion in model container [2019-08-05 10:48:13,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:48:13" (2/2) ... [2019-08-05 10:48:13,948 INFO L109 eAbstractionObserver]: Analyzing ICFG gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:48:13,958 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:48:13,965 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:48:13,980 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:48:14,006 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:48:14,007 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:48:14,007 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:48:14,007 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:48:14,007 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:48:14,007 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:48:14,008 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:48:14,008 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:48:14,008 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:48:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:48:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:48:14,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:14,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:48:14,037 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:14,043 INFO L82 PathProgramCache]: Analyzing trace with hash 942136, now seen corresponding path program 1 times [2019-08-05 10:48:14,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:14,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:48:14,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:14,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:14,330 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:48:14,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:48:14,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:48:14,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:48:14,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:48:14,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:48:14,349 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 10:48:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:14,497 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:48:14,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:48:14,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:48:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:14,509 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:48:14,509 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:48:14,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:48:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:48:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:48:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:48:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:48:14,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 10:48:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:14,545 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:48:14,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:48:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:48:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:48:14,546 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:14,546 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:48:14,547 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash 905456478, now seen corresponding path program 1 times [2019-08-05 10:48:14,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:14,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:48:14,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:14,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:14,879 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:48:14,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:14,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:48:14,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:48:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:48:14,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:48:14,883 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 10:48:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:15,168 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:48:15,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:48:15,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:48:15,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:15,169 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:48:15,170 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:48:15,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:48:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:48:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:48:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:48:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:48:15,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 10:48:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:15,186 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:48:15,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:48:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:48:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:48:15,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:15,187 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 10:48:15,188 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1734621948, now seen corresponding path program 2 times [2019-08-05 10:48:15,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:15,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:48:15,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:15,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:15,432 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:48:15,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:15,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:48:15,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:48:15,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:48:15,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:48:15,434 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-08-05 10:48:15,709 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-08-05 10:48:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:15,726 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:48:15,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:48:15,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:48:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:15,730 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:48:15,730 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:48:15,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:48:15,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:48:15,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:48:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:48:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:48:15,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:48:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:15,736 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:48:15,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:48:15,736 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:48:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:48:15,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:15,737 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 10:48:15,737 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:15,738 INFO L82 PathProgramCache]: Analyzing trace with hash -524317398, now seen corresponding path program 3 times [2019-08-05 10:48:15,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:15,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:48:15,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:15,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:15,880 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:48:15,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:15,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:48:15,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:48:15,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:48:15,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:48:15,882 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2019-08-05 10:48:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:16,125 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:48:16,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:48:16,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:48:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:16,128 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:48:16,128 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:48:16,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:48:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:48:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:48:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:48:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:48:16,135 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:48:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:16,136 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:48:16,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:48:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:48:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:48:16,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:16,137 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 10:48:16,137 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:16,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:16,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1357782064, now seen corresponding path program 4 times [2019-08-05 10:48:16,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:16,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:48:16,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:16,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:16,477 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:48:16,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:16,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:48:16,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:48:16,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:48:16,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:48:16,479 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-08-05 10:48:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:16,705 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:48:16,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:48:16,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:48:16,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:16,707 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:48:16,707 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:48:16,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:48:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:48:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 10:48:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:48:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:48:16,711 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:48:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:16,712 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:48:16,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:48:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:48:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:48:16,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:16,713 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 10:48:16,713 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash 841558262, now seen corresponding path program 5 times [2019-08-05 10:48:16,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:16,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:48:16,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:16,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:16,907 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:48:16,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:16,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:48:16,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:48:16,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:48:16,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:48:16,909 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2019-08-05 10:48:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:17,151 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:48:17,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:48:17,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-08-05 10:48:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:17,153 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:48:17,153 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:48:17,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:48:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:48:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:48:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:48:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:48:17,158 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:48:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:17,159 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:48:17,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:48:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:48:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:48:17,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:17,160 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 10:48:17,160 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:17,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1283701916, now seen corresponding path program 6 times [2019-08-05 10:48:17,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:17,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:48:17,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:17,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:17,375 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:48:17,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:17,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:48:17,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:48:17,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:48:17,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:48:17,378 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-08-05 10:48:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:17,633 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:48:17,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:48:17,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:48:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:17,634 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:48:17,634 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:48:17,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:48:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:48:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 10:48:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:48:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:48:17,639 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 10:48:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:17,639 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:48:17,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:48:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:48:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:48:17,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:17,640 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 10:48:17,640 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash 981991106, now seen corresponding path program 7 times [2019-08-05 10:48:17,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:17,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:48:17,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:17,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:17,814 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:48:17,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:17,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:48:17,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:48:17,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:48:17,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:48:17,815 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2019-08-05 10:48:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:18,017 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:48:18,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:48:18,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-08-05 10:48:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:18,021 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:48:18,021 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:48:18,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:48:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:48:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 10:48:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:48:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:48:18,024 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 10:48:18,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:18,025 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:48:18,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:48:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:48:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:48:18,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:18,026 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 10:48:18,026 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:18,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1199288472, now seen corresponding path program 8 times [2019-08-05 10:48:18,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:18,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:48:18,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:18,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:18,174 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:48:18,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:18,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:48:18,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:48:18,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:48:18,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:48:18,176 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-08-05 10:48:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:18,400 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:48:18,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:48:18,402 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-08-05 10:48:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:18,403 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:48:18,403 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:48:18,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=293, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:48:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:48:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 10:48:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:48:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:48:18,408 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 10:48:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:18,408 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:48:18,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:48:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:48:18,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:48:18,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:18,409 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 10:48:18,410 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:18,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:18,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1464922482, now seen corresponding path program 9 times [2019-08-05 10:48:18,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:18,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:48:18,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:18,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:18,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:18,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:48:18,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:48:18,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:48:18,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:48:18,595 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2019-08-05 10:48:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:18,960 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:48:18,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:48:18,961 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-08-05 10:48:18,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:18,962 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:48:18,962 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:48:18,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=350, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:48:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:48:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 10:48:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:48:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:48:18,966 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 10:48:18,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:18,967 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:48:18,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:48:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:48:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:48:18,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:18,968 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 10:48:18,968 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:18,968 INFO L82 PathProgramCache]: Analyzing trace with hash 958831668, now seen corresponding path program 10 times [2019-08-05 10:48:18,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:18,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:48:18,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:19,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:19,143 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:48:19,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:19,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:48:19,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:48:19,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:48:19,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:48:19,145 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-08-05 10:48:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:19,691 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:48:19,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:48:19,691 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-08-05 10:48:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:19,692 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:48:19,692 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:48:19,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:48:19,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:48:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 10:48:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:48:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:48:19,698 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 10:48:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:19,698 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:48:19,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:48:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:48:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:48:19,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:19,700 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 10:48:19,700 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:19,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1980671910, now seen corresponding path program 11 times [2019-08-05 10:48:19,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:19,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:48:19,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:20,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:20,202 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:48:20,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:20,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:48:20,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:48:20,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:48:20,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:48:20,204 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2019-08-05 10:48:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:20,511 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:48:20,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:48:20,513 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-08-05 10:48:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:20,514 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:48:20,514 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:48:20,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=479, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:48:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 10:48:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:48:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:48:20,518 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 10:48:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:20,518 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:48:20,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:48:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:48:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:48:20,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:20,519 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 10:48:20,520 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:20,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash -755129600, now seen corresponding path program 12 times [2019-08-05 10:48:20,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:20,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:48:20,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:20,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:20,714 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:48:20,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:20,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:48:20,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:48:20,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:48:20,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:48:20,716 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-08-05 10:48:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,124 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:48:21,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:48:21,124 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-08-05 10:48:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,125 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:48:21,125 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:48:21,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:48:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:48:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 10:48:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:48:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:48:21,130 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 10:48:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,131 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:48:21,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:48:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:48:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:48:21,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,132 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 10:48:21,134 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,134 INFO L82 PathProgramCache]: Analyzing trace with hash 169991206, now seen corresponding path program 13 times [2019-08-05 10:48:21,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,624 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:48:21,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:21,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:48:21,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:48:21,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:48:21,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:48:21,626 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2019-08-05 10:48:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,959 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:48:21,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:48:21,960 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-08-05 10:48:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,961 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:48:21,961 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:48:21,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=364, Invalid=628, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:48:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:48:21,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 10:48:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:48:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:48:21,967 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 10:48:21,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,968 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:48:21,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:48:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:48:21,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:48:21,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,969 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 10:48:21,969 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,969 INFO L82 PathProgramCache]: Analyzing trace with hash 152855500, now seen corresponding path program 14 times [2019-08-05 10:48:21,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:22,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:22,543 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:48:22,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:22,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:48:22,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:48:22,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:48:22,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:48:22,544 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-08-05 10:48:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:22,921 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:48:22,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:48:22,921 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-08-05 10:48:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:22,922 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:48:22,922 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:48:22,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=412, Invalid=710, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:48:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:48:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 10:48:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:48:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:48:22,926 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 10:48:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:22,926 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:48:22,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:48:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:48:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:48:22,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:22,927 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 10:48:22,927 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:22,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:22,928 INFO L82 PathProgramCache]: Analyzing trace with hash 865311218, now seen corresponding path program 15 times [2019-08-05 10:48:22,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:22,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:48:22,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:23,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,186 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:48:23,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:23,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:48:23,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:48:23,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:48:23,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:48:23,188 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2019-08-05 10:48:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:23,612 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:48:23,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:48:23,614 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-08-05 10:48:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:23,614 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:48:23,615 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:48:23,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=463, Invalid=797, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:48:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:48:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 10:48:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:48:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:48:23,618 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 10:48:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:23,618 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:48:23,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:48:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:48:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:48:23,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:23,620 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 10:48:23,620 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1659511144, now seen corresponding path program 16 times [2019-08-05 10:48:23,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:23,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:48:23,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:23,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:23,837 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:48:23,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:23,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:48:23,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:48:23,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:48:23,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:48:23,839 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-08-05 10:48:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:24,273 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:48:24,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:48:24,274 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-08-05 10:48:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:24,275 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:48:24,275 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:48:24,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=517, Invalid=889, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:48:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:48:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 10:48:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:48:24,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:48:24,280 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 10:48:24,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:24,281 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:48:24,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:48:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:48:24,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:48:24,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:24,282 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 10:48:24,282 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:24,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:24,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1357278786, now seen corresponding path program 17 times [2019-08-05 10:48:24,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:24,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:48:24,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:24,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,543 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:48:24,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:24,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:48:24,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:48:24,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:48:24,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:48:24,546 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2019-08-05 10:48:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:25,036 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:48:25,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:48:25,036 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-08-05 10:48:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:25,036 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:48:25,037 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:48:25,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=574, Invalid=986, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:48:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:48:25,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 10:48:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:48:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:48:25,041 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 10:48:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:25,041 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:48:25,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:48:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:48:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:48:25,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:25,043 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 10:48:25,043 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:25,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:25,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1325208420, now seen corresponding path program 18 times [2019-08-05 10:48:25,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:25,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:48:25,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:25,433 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:25,446 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:48:25,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:25,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:48:25,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:48:25,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:48:25,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:48:25,448 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-08-05 10:48:25,987 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-08-05 10:48:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:26,248 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:48:26,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:48:26,248 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-08-05 10:48:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:26,249 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:48:26,249 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:48:26,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=634, Invalid=1088, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:48:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:48:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 10:48:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:48:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:48:26,253 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 10:48:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:26,253 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:48:26,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:48:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:48:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:48:26,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:26,254 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 10:48:26,254 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:26,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2079931510, now seen corresponding path program 19 times [2019-08-05 10:48:26,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:26,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:48:26,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:26,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,520 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:48:26,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:26,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:48:26,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:48:26,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:48:26,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:48:26,522 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2019-08-05 10:48:26,966 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-08-05 10:48:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:27,416 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:48:27,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:48:27,416 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-08-05 10:48:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:27,417 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:48:27,417 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:48:27,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=697, Invalid=1195, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:48:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:48:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 10:48:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:48:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:48:27,423 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 10:48:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:27,423 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:48:27,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:48:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:48:27,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:48:27,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:27,424 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 10:48:27,424 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:27,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:27,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1654324688, now seen corresponding path program 20 times [2019-08-05 10:48:27,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:27,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:48:27,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:27,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:28,028 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:48:28,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:28,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:48:28,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:48:28,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:48:28,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:48:28,029 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-08-05 10:48:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:28,644 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:48:28,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:48:28,644 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-08-05 10:48:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:28,645 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:48:28,645 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:48:28,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=763, Invalid=1307, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:48:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:48:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 10:48:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:48:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:48:28,649 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 10:48:28,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:28,649 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:48:28,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:48:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:48:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:48:28,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:28,650 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 10:48:28,651 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:28,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:28,651 INFO L82 PathProgramCache]: Analyzing trace with hash -668061866, now seen corresponding path program 21 times [2019-08-05 10:48:28,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:28,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:48:28,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:29,475 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,489 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:48:29,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:29,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:48:29,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:48:29,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:48:29,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:48:29,491 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2019-08-05 10:48:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:30,011 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:48:30,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:48:30,014 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-08-05 10:48:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:30,015 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:48:30,015 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:48:30,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=832, Invalid=1424, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:48:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:48:30,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:48:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:48:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:48:30,019 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 10:48:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:30,019 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:48:30,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:48:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:48:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:48:30,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:30,020 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 10:48:30,020 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:30,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:30,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2057262340, now seen corresponding path program 22 times [2019-08-05 10:48:30,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:30,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:48:30,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:30,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:30,554 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:48:30,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:30,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:48:30,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:48:30,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:48:30,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:48:30,555 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-08-05 10:48:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:31,184 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:48:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:48:31,184 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-08-05 10:48:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:31,185 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:48:31,185 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:48:31,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=904, Invalid=1546, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:48:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:48:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 10:48:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:48:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:48:31,193 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 10:48:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:31,193 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:48:31,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:48:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:48:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:48:31,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:31,194 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 10:48:31,194 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:31,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:31,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1344088798, now seen corresponding path program 23 times [2019-08-05 10:48:31,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:31,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:48:31,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:32,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:32,719 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:48:32,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:32,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:48:32,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:48:32,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:48:32,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:48:32,721 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2019-08-05 10:48:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:33,338 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:48:33,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:48:33,338 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-08-05 10:48:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:33,339 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:48:33,339 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:48:33,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=979, Invalid=1673, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:48:33,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:48:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 10:48:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:48:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:48:33,343 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 10:48:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:33,344 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:48:33,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:48:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:48:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:48:33,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:33,344 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 10:48:33,344 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:33,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:33,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1115885000, now seen corresponding path program 24 times [2019-08-05 10:48:33,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:33,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:48:33,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:33,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:33,814 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:48:33,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:33,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:48:33,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:48:33,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:48:33,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:33,816 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-08-05 10:48:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:34,510 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:48:34,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:48:34,510 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-08-05 10:48:34,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:34,511 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:48:34,511 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:48:34,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1057, Invalid=1805, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:48:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:48:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 10:48:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:48:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:48:34,516 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 10:48:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:34,516 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:48:34,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:48:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:48:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:48:34,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:34,517 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 10:48:34,517 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:34,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:34,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1376275218, now seen corresponding path program 25 times [2019-08-05 10:48:34,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:34,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:48:34,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:34,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:34,845 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:48:34,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:34,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:48:34,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:48:34,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:48:34,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:48:34,846 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2019-08-05 10:48:35,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:35,788 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:48:35,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:48:35,789 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-08-05 10:48:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:35,789 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:48:35,790 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:48:35,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1138, Invalid=1942, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:48:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:48:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 10:48:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:48:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:48:35,794 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 10:48:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:35,794 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:48:35,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:48:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:48:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:48:35,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:35,795 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 10:48:35,796 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:35,796 INFO L82 PathProgramCache]: Analyzing trace with hash 249506452, now seen corresponding path program 26 times [2019-08-05 10:48:35,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:35,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:48:35,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:36,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:36,180 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:48:36,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:36,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:48:36,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:48:36,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:48:36,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=488, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:48:36,182 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-08-05 10:48:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:36,889 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:48:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:48:36,890 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-08-05 10:48:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:36,890 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:48:36,890 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:48:36,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1222, Invalid=2084, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:48:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:48:36,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 10:48:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:48:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:48:36,895 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 10:48:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:36,895 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:48:36,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:48:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:48:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:48:36,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:36,896 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 10:48:36,896 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:36,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash -742404422, now seen corresponding path program 27 times [2019-08-05 10:48:36,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:36,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:48:36,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:37,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:37,310 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:48:37,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:37,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:48:37,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:48:37,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:48:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=520, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:48:37,311 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2019-08-05 10:48:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:38,196 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:48:38,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:48:38,196 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-08-05 10:48:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:38,197 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:48:38,197 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:48:38,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1309, Invalid=2231, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:48:38,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:48:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 10:48:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:48:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:48:38,202 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 10:48:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:38,202 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:48:38,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:48:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:48:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:48:38,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:38,203 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 10:48:38,203 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash -486014624, now seen corresponding path program 28 times [2019-08-05 10:48:38,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:38,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:48:38,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:38,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:38,584 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:48:38,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:38,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:48:38,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:48:38,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:48:38,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=553, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:48:38,586 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-08-05 10:48:39,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:39,451 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:48:39,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:48:39,454 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-08-05 10:48:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:39,454 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:48:39,454 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:48:39,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1399, Invalid=2383, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:48:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:48:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 10:48:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:48:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:48:39,457 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 10:48:39,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:39,458 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:48:39,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:48:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:48:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:48:39,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:39,458 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 10:48:39,459 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:39,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:39,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1091445382, now seen corresponding path program 29 times [2019-08-05 10:48:39,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:39,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:48:39,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:39,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:40,361 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:48:40,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:40,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:48:40,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:48:40,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:48:40,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=587, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:48:40,363 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2019-08-05 10:48:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:41,347 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:48:41,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:48:41,348 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-08-05 10:48:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:41,349 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:48:41,349 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:48:41,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1492, Invalid=2540, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:48:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:48:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 10:48:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:48:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:48:41,353 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 10:48:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:41,353 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:48:41,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:48:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:48:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:48:41,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:41,354 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 10:48:41,354 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:41,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:41,355 INFO L82 PathProgramCache]: Analyzing trace with hash 907055660, now seen corresponding path program 30 times [2019-08-05 10:48:41,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:41,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:48:41,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:41,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:41,803 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:48:41,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:41,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:48:41,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:48:41,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:48:41,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=622, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:48:41,804 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-08-05 10:48:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:42,739 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:48:42,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:48:42,740 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-08-05 10:48:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:42,740 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:48:42,741 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:48:42,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1588, Invalid=2702, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:48:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:48:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 10:48:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:48:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:48:42,745 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 10:48:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:42,746 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:48:42,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:48:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:48:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:48:42,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:42,746 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 10:48:42,747 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash -197808046, now seen corresponding path program 31 times [2019-08-05 10:48:42,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:42,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:48:42,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:43,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,264 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:48:43,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:43,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:48:43,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:48:43,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:48:43,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=658, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:48:43,266 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2019-08-05 10:48:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:44,257 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:48:44,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:48:44,258 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-08-05 10:48:44,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:44,259 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:48:44,259 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:48:44,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1687, Invalid=2869, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:48:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:48:44,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 10:48:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:48:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:48:44,263 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 10:48:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:44,263 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:48:44,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:48:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:48:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:48:44,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:44,264 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 10:48:44,264 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:44,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:44,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1114907400, now seen corresponding path program 32 times [2019-08-05 10:48:44,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:44,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:48:44,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:44,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:44,759 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:48:44,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:44,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:48:44,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:48:44,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:48:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=695, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:48:44,761 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-08-05 10:48:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:45,890 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:48:45,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:48:45,890 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-08-05 10:48:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:45,891 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:48:45,891 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:48:45,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1789, Invalid=3041, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:48:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:48:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 10:48:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:48:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:48:45,895 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 10:48:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:45,895 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:48:45,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:48:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:48:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:48:45,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:45,896 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 10:48:45,899 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:45,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:45,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1979090914, now seen corresponding path program 33 times [2019-08-05 10:48:45,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:45,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:48:45,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:46,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:46,415 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:48:46,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:46,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:48:46,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:48:46,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:48:46,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=733, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:48:46,417 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2019-08-05 10:48:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:47,451 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:48:47,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:48:47,452 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-08-05 10:48:47,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:47,452 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:48:47,452 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:48:47,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1894, Invalid=3218, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:48:47,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:48:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 10:48:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:48:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:48:47,455 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 10:48:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:47,455 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:48:47,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:48:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:48:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:48:47,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:47,456 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 10:48:47,456 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:47,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash 764207556, now seen corresponding path program 34 times [2019-08-05 10:48:47,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:47,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:48:47,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:48,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:48,542 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:48:48,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:48,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:48:48,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:48:48,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:48:48,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=772, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:48:48,543 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-08-05 10:48:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:49,627 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:48:49,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:48:49,627 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-08-05 10:48:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:49,628 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:48:49,628 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:48:49,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2002, Invalid=3400, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:48:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:48:49,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 10:48:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:48:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:48:49,631 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 10:48:49,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:49,631 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:48:49,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:48:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:48:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:48:49,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:49,632 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 10:48:49,632 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:49,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:49,632 INFO L82 PathProgramCache]: Analyzing trace with hash -35882518, now seen corresponding path program 35 times [2019-08-05 10:48:49,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:49,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:48:49,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:50,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:50,193 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:48:50,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:50,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:48:50,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:48:50,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:48:50,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:48:50,194 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2019-08-05 10:48:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:51,527 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:48:51,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:48:51,527 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-08-05 10:48:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:51,528 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:48:51,528 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:48:51,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2113, Invalid=3587, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:48:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:48:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 10:48:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:48:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:48:51,532 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 10:48:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:51,532 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:48:51,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:48:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:48:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:48:51,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:51,532 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 10:48:51,533 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:51,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:51,533 INFO L82 PathProgramCache]: Analyzing trace with hash -123297648, now seen corresponding path program 36 times [2019-08-05 10:48:51,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:51,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:48:51,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:52,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:52,132 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:48:52,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:52,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:48:52,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:48:52,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:48:52,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=853, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:48:52,133 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-08-05 10:48:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:53,345 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:48:53,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:48:53,345 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-08-05 10:48:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:53,347 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:48:53,347 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:48:53,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2227, Invalid=3779, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:48:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:48:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 10:48:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:48:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:48:53,350 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 10:48:53,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:53,351 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:48:53,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:48:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:48:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:48:53,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:53,351 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 10:48:53,352 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:53,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:53,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1770108342, now seen corresponding path program 37 times [2019-08-05 10:48:53,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:53,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:48:53,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:54,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:54,068 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:48:54,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:54,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:48:54,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:48:54,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:48:54,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=895, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:48:54,070 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2019-08-05 10:48:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:55,235 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:48:55,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:48:55,235 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2019-08-05 10:48:55,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:55,236 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:48:55,237 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:48:55,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2344, Invalid=3976, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:48:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:48:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 10:48:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:48:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:48:55,241 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 10:48:55,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:55,242 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:48:55,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:48:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:48:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:48:55,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:55,243 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 10:48:55,243 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:55,243 INFO L82 PathProgramCache]: Analyzing trace with hash 267131228, now seen corresponding path program 38 times [2019-08-05 10:48:55,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:55,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:48:55,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:56,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:56,175 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:48:56,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:56,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:48:56,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:48:56,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:48:56,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=784, Invalid=938, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:48:56,176 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-08-05 10:48:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:57,398 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:48:57,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:48:57,398 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-08-05 10:48:57,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:57,399 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:48:57,399 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:48:57,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2464, Invalid=4178, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:48:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:48:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 10:48:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:48:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:48:57,403 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 10:48:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:57,403 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:48:57,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:48:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:48:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:48:57,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:57,403 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 10:48:57,404 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:57,404 INFO L82 PathProgramCache]: Analyzing trace with hash -984863870, now seen corresponding path program 39 times [2019-08-05 10:48:57,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:57,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:48:57,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:58,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:58,053 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:48:58,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:58,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:48:58,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:48:58,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:48:58,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=824, Invalid=982, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:48:58,055 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2019-08-05 10:48:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:59,365 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:48:59,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:48:59,366 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2019-08-05 10:48:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:59,367 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:48:59,367 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:48:59,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2587, Invalid=4385, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:48:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:48:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 10:48:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:48:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:48:59,371 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 10:48:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:59,371 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:48:59,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:48:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:48:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:48:59,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:59,372 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 10:48:59,373 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:59,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:59,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1561310168, now seen corresponding path program 40 times [2019-08-05 10:48:59,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:59,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:48:59,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:00,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,241 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:49:00,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:00,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:49:00,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:49:00,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:49:00,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=1027, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:49:00,242 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-08-05 10:49:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:01,738 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:49:01,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:49:01,738 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-08-05 10:49:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:01,739 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:49:01,739 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:49:01,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2713, Invalid=4597, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:49:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:49:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 10:49:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:49:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:49:01,743 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 10:49:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:01,743 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:49:01,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:49:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:49:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:49:01,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:01,744 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 10:49:01,744 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:01,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:01,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1475421362, now seen corresponding path program 41 times [2019-08-05 10:49:01,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:01,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:49:01,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:02,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:02,521 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:49:02,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:02,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:49:02,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:49:02,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:49:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=1073, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:49:02,523 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2019-08-05 10:49:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:03,865 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:49:03,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:49:03,865 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2019-08-05 10:49:03,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:03,866 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:49:03,867 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:49:03,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2842, Invalid=4814, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:49:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:49:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 10:49:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:49:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:49:03,870 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 10:49:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:03,870 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:49:03,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:49:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:49:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:49:03,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:03,871 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 10:49:03,871 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:03,871 INFO L82 PathProgramCache]: Analyzing trace with hash -540657420, now seen corresponding path program 42 times [2019-08-05 10:49:03,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:03,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:49:03,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:04,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,692 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:49:04,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:04,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:49:04,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:49:04,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:49:04,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=950, Invalid=1120, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:49:04,693 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-08-05 10:49:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:06,322 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:49:06,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:49:06,322 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-08-05 10:49:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:06,323 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:49:06,323 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:49:06,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2974, Invalid=5036, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:49:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:49:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 10:49:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:49:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:49:06,327 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 10:49:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:06,328 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:49:06,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:49:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:49:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:49:06,328 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:06,328 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 10:49:06,329 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:06,329 INFO L82 PathProgramCache]: Analyzing trace with hash 119325978, now seen corresponding path program 43 times [2019-08-05 10:49:06,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:06,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:49:06,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:07,076 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:49:07,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:49:07,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:49:07,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:49:07,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=1168, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:49:07,077 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2019-08-05 10:49:07,305 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2019-08-05 10:49:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:08,756 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:49:08,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:49:08,756 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2019-08-05 10:49:08,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:08,757 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:49:08,757 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:49:08,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3109, Invalid=5263, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:49:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:49:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 10:49:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:49:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:49:08,761 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 10:49:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:08,761 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:49:08,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:49:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:49:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:49:08,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:08,762 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 10:49:08,762 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:08,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:08,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1291788352, now seen corresponding path program 44 times [2019-08-05 10:49:08,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:08,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:49:08,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:09,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:09,733 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:49:09,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:09,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:49:09,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:49:09,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:49:09,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1039, Invalid=1217, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:49:09,734 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-08-05 10:49:11,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:11,481 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:49:11,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:49:11,482 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-08-05 10:49:11,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:11,483 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:49:11,483 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:49:11,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3247, Invalid=5495, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:49:11,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:49:11,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 10:49:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:49:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:49:11,485 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 10:49:11,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:11,486 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:49:11,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:49:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:49:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:49:11,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:11,487 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 10:49:11,487 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:11,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:11,487 INFO L82 PathProgramCache]: Analyzing trace with hash -162993946, now seen corresponding path program 45 times [2019-08-05 10:49:11,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:11,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:49:11,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:12,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:12,629 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:49:12,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:12,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:49:12,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:49:12,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:49:12,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=1267, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:49:12,631 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2019-08-05 10:49:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:14,230 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:49:14,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:49:14,231 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2019-08-05 10:49:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:14,232 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:49:14,232 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:49:14,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3388, Invalid=5732, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:49:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:49:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 10:49:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:49:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:49:14,236 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 10:49:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:14,236 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:49:14,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:49:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:49:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:49:14,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:14,237 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 10:49:14,237 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:14,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:14,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2018295668, now seen corresponding path program 46 times [2019-08-05 10:49:14,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:14,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:49:14,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:15,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:15,091 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:49:15,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:15,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:49:15,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:49:15,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:49:15,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:49:15,092 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-08-05 10:49:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:16,991 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:49:16,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:49:16,991 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-08-05 10:49:16,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:16,992 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:49:16,992 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:49:16,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3532, Invalid=5974, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:49:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:49:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 10:49:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:49:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:49:16,996 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 10:49:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:16,997 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:49:16,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:49:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:49:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:49:16,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:16,998 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 10:49:16,998 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:16,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:16,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1743144626, now seen corresponding path program 47 times [2019-08-05 10:49:16,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:17,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:49:17,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:17,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:18,019 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:49:18,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:18,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:49:18,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:49:18,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:49:18,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=1370, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:49:18,020 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2019-08-05 10:49:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:20,270 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:49:20,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:49:20,270 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2019-08-05 10:49:20,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:20,271 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:49:20,271 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:49:20,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3679, Invalid=6221, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:49:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:49:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 10:49:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:49:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:49:20,277 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 10:49:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:20,277 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:49:20,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:49:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:49:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:49:20,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:20,278 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 10:49:20,278 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:20,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:20,278 INFO L82 PathProgramCache]: Analyzing trace with hash 124803928, now seen corresponding path program 48 times [2019-08-05 10:49:20,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:20,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:49:20,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:22,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:22,053 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:49:22,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:22,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:49:22,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:49:22,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:49:22,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=1423, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:49:22,054 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-08-05 10:49:22,277 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2019-08-05 10:49:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:23,974 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:49:23,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:49:23,975 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-08-05 10:49:23,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:23,976 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:49:23,976 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:49:23,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3829, Invalid=6473, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:49:23,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:49:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 10:49:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:49:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:49:23,979 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 10:49:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:23,980 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:49:23,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:49:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:49:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:49:23,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:23,981 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 10:49:23,981 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:23,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:23,981 INFO L82 PathProgramCache]: Analyzing trace with hash -322445698, now seen corresponding path program 49 times [2019-08-05 10:49:23,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:24,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:49:24,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:24,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:24,957 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:49:24,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:24,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:49:24,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:49:24,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:49:24,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=1477, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:49:24,959 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2019-08-05 10:49:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:27,036 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:49:27,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:49:27,037 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2019-08-05 10:49:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:27,038 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:49:27,038 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:49:27,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3982, Invalid=6730, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:49:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:49:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 10:49:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:49:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:49:27,042 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 10:49:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:27,042 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:49:27,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:49:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:49:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:49:27,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:27,043 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 10:49:27,044 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:27,044 INFO L82 PathProgramCache]: Analyzing trace with hash -632606684, now seen corresponding path program 50 times [2019-08-05 10:49:27,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:27,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:49:27,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:28,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:28,297 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:49:28,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:28,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:49:28,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:49:28,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:49:28,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1283, Invalid=1579, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:49:28,298 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-08-05 10:49:30,054 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-08-05 10:49:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:30,849 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:49:30,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:49:30,849 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-08-05 10:49:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:30,851 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:49:30,851 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:49:30,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4037, Invalid=6883, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:49:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:49:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:49:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:49:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:49:30,854 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 10:49:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:30,855 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:49:30,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:49:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:49:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:49:30,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:30,856 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 10:49:30,856 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:30,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:30,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1950396490, now seen corresponding path program 51 times [2019-08-05 10:49:30,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:30,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:49:30,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:32,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:32,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:32,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:32,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:32,931 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:49:32,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:32,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:49:32,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:49:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:49:32,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3069, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:49:32,934 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 57 states. [2019-08-05 10:49:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:38,008 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:49:38,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:49:38,009 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 106 [2019-08-05 10:49:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:38,010 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:49:38,010 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:49:38,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=368, Invalid=10762, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:49:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:49:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:49:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:49:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:49:38,014 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 10:49:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:38,015 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:49:38,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:49:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:49:38,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:49:38,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:38,016 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 10:49:38,016 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:38,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:38,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1725349616, now seen corresponding path program 52 times [2019-08-05 10:49:38,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:38,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:49:38,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:39,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:39,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:39,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:39,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:39,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:39,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:39,943 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:49:39,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:39,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:49:39,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:49:39,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:49:39,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=3400, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:49:39,944 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 60 states. [2019-08-05 10:49:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:45,022 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:49:45,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:49:45,022 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 108 [2019-08-05 10:49:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:45,023 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:49:45,023 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:49:45,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=380, Invalid=11176, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:49:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:49:45,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:49:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:49:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:49:45,027 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-05 10:49:45,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:45,027 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:49:45,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:49:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:49:45,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:49:45,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:45,028 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-05 10:49:45,028 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:45,029 INFO L82 PathProgramCache]: Analyzing trace with hash 203668502, now seen corresponding path program 53 times [2019-08-05 10:49:45,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:45,059 WARN L254 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:49:45,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:46,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:46,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:46,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:46,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:46,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:46,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:46,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:47,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:47,134 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:49:47,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:47,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:49:47,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:49:47,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:49:47,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=3749, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:49:47,135 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 63 states. [2019-08-05 10:49:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:51,861 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:49:51,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:49:51,861 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 110 [2019-08-05 10:49:51,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:51,862 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:49:51,863 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:49:51,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=392, Invalid=11598, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:49:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:49:51,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:49:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:49:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:49:51,866 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-05 10:49:51,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:51,867 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:49:51,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:49:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:49:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:49:51,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:51,868 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-05 10:49:51,868 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:51,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:51,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1843001412, now seen corresponding path program 54 times [2019-08-05 10:49:51,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:51,896 WARN L254 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:49:51,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:53,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:53,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:53,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:53,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:53,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:53,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:53,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:53,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:53,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:53,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:54,039 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:49:54,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:54,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:49:54,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:49:54,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:49:54,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=4116, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:49:54,040 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 66 states. [2019-08-05 10:49:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:59,001 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:49:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:49:59,002 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 112 [2019-08-05 10:49:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:59,003 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:49:59,003 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:49:59,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=404, Invalid=12028, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:49:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:49:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:49:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:49:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:49:59,007 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-05 10:49:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:59,008 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:49:59,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:49:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:49:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:49:59,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:59,009 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-05 10:49:59,009 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:59,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1597767198, now seen corresponding path program 55 times [2019-08-05 10:49:59,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:59,041 WARN L254 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:49:59,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:00,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:00,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:00,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:00,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:00,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:00,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:00,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:00,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:00,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:00,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:01,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:01,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:01,195 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:50:01,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:01,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:50:01,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:50:01,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:50:01,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=4501, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:50:01,197 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 69 states. [2019-08-05 10:50:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:06,410 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:50:06,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:50:06,411 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 114 [2019-08-05 10:50:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:06,412 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:50:06,412 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:50:06,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=416, Invalid=12466, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:50:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:50:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:50:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:50:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:50:06,416 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-05 10:50:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:06,416 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:50:06,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:50:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:50:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:50:06,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:06,417 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-05 10:50:06,418 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:06,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:06,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2144078472, now seen corresponding path program 56 times [2019-08-05 10:50:06,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:06,445 WARN L254 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:50:06,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:07,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:07,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:07,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:07,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:07,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:08,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:08,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:08,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:08,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:08,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:08,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:08,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:09,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:09,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:09,576 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:50:09,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:09,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:50:09,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:50:09,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:50:09,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=4904, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:50:09,578 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 72 states. [2019-08-05 10:50:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:14,997 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:50:14,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:50:14,998 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 116 [2019-08-05 10:50:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:14,999 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:50:14,999 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:50:15,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=428, Invalid=12912, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:50:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:50:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:50:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:50:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:50:15,002 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-08-05 10:50:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:15,002 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:50:15,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:50:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:50:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:50:15,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:15,003 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2019-08-05 10:50:15,003 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:15,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1124826706, now seen corresponding path program 57 times [2019-08-05 10:50:15,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:15,030 WARN L254 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:50:15,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:15,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:15,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:16,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:16,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:16,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:16,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:16,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:16,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:16,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:16,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:16,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:16,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:17,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:17,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:17,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:17,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:17,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:17,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:50:17,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:50:17,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:50:17,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5325, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:50:17,457 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 75 states. [2019-08-05 10:50:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:23,526 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:50:23,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:50:23,526 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 118 [2019-08-05 10:50:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:23,527 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:50:23,527 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:50:23,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1812 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=440, Invalid=13366, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:50:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:50:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:50:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:50:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:50:23,530 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-08-05 10:50:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:23,531 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:50:23,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:50:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:50:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:50:23,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:23,531 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2019-08-05 10:50:23,531 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:23,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:23,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1373357908, now seen corresponding path program 58 times [2019-08-05 10:50:23,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:23,561 WARN L254 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:50:23,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:24,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:24,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:24,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:24,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:24,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:24,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:24,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:25,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:25,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:25,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:25,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:25,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:25,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:25,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:25,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:25,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:26,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:26,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:26,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:26,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:50:26,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:50:26,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:50:26,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=5764, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:50:26,192 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 78 states. [2019-08-05 10:50:31,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:31,866 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 10:50:31,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:50:31,866 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 120 [2019-08-05 10:50:31,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:31,867 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:50:31,868 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:50:31,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1924 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=452, Invalid=13828, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:50:31,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:50:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 10:50:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:50:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-05 10:50:31,872 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-08-05 10:50:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:31,872 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-05 10:50:31,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:50:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-05 10:50:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:50:31,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:31,873 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2019-08-05 10:50:31,873 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1242053498, now seen corresponding path program 59 times [2019-08-05 10:50:31,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:31,905 WARN L254 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:50:31,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:32,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:32,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:33,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:33,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:33,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:33,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:33,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:33,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:33,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:33,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:33,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:34,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:34,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:34,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:34,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:34,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:34,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:34,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:34,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:35,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:35,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:35,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:50:35,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:50:35,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:50:35,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=6221, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:50:35,081 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 81 states. [2019-08-05 10:50:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:40,999 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 10:50:41,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:50:41,000 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 122 [2019-08-05 10:50:41,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:41,001 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:50:41,001 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:50:41,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2043 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=464, Invalid=14298, Unknown=0, NotChecked=0, Total=14762 [2019-08-05 10:50:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:50:41,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 10:50:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:50:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 10:50:41,004 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-08-05 10:50:41,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:41,005 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 10:50:41,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:50:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 10:50:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:50:41,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:41,005 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2019-08-05 10:50:41,006 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:41,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:41,006 INFO L82 PathProgramCache]: Analyzing trace with hash -387432928, now seen corresponding path program 60 times [2019-08-05 10:50:41,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:41,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:50:41,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:41,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:41,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:41,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:42,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:42,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:42,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:42,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:42,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:42,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:42,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:42,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:42,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:42,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:43,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:43,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:43,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:43,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:43,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:43,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:44,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:44,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:44,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:44,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:44,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:50:44,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:50:44,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:50:44,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=6696, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:50:44,340 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 84 states. [2019-08-05 10:50:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:50,378 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-08-05 10:50:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:50:50,378 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 124 [2019-08-05 10:50:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:50,379 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:50:50,379 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:50:50,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2169 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=476, Invalid=14776, Unknown=0, NotChecked=0, Total=15252 [2019-08-05 10:50:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:50:50,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 10:50:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:50:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-08-05 10:50:50,383 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-08-05 10:50:50,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:50,383 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-08-05 10:50:50,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:50:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-08-05 10:50:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 10:50:50,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:50,384 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2019-08-05 10:50:50,385 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:50,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:50,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1339174726, now seen corresponding path program 61 times [2019-08-05 10:50:50,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:50,415 WARN L254 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:50:50,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:51,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:51,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:51,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:51,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:51,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:51,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:51,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:51,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:51,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:51,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:52,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:52,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:52,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:52,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:52,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:52,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:52,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:52,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:52,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:53,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:53,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:53,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:53,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:53,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:53,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:53,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:50:53,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:50:53,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:50:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=7189, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:50:53,918 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 87 states. [2019-08-05 10:51:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:00,054 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-08-05 10:51:00,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:51:00,055 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 126 [2019-08-05 10:51:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:00,056 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:51:00,056 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 10:51:00,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=488, Invalid=15262, Unknown=0, NotChecked=0, Total=15750 [2019-08-05 10:51:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 10:51:00,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-05 10:51:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:51:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-08-05 10:51:00,060 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-08-05 10:51:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:00,060 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-08-05 10:51:00,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:51:00,060 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-08-05 10:51:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:51:00,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:00,061 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2019-08-05 10:51:00,061 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:00,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:00,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1543213332, now seen corresponding path program 62 times [2019-08-05 10:51:00,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:00,104 WARN L254 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:51:00,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:00,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:00,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:00,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:01,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:01,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:01,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:01,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:01,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:01,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:01,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:01,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:01,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:01,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:02,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:02,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:02,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:02,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:02,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:02,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:02,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:02,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:03,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:03,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:03,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:03,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:03,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:03,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:03,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:51:03,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:51:03,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:51:03,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=7700, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:51:03,599 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 90 states. [2019-08-05 10:51:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:10,157 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-05 10:51:10,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:51:10,158 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 128 [2019-08-05 10:51:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:10,159 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:51:10,159 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:51:10,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2442 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=500, Invalid=15756, Unknown=0, NotChecked=0, Total=16256 [2019-08-05 10:51:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:51:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-05 10:51:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:51:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-08-05 10:51:10,162 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-08-05 10:51:10,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:10,163 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-08-05 10:51:10,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:51:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-08-05 10:51:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:51:10,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:10,164 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2019-08-05 10:51:10,164 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:10,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1264231150, now seen corresponding path program 63 times [2019-08-05 10:51:10,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:10,196 WARN L254 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:51:10,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:10,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:10,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:11,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:11,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:11,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:11,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:11,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:11,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:11,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:11,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:11,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:11,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:12,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:12,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:12,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:12,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:12,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:12,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:12,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:12,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:12,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:13,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:13,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:13,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:13,475 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:13,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:13,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:13,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:13,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:13,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:51:13,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:51:13,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:51:13,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=8229, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:51:13,985 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 93 states. [2019-08-05 10:51:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:20,595 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 10:51:20,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:51:20,596 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 130 [2019-08-05 10:51:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:20,597 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:51:20,597 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:51:20,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2589 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=512, Invalid=16258, Unknown=0, NotChecked=0, Total=16770 [2019-08-05 10:51:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:51:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:51:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:51:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-08-05 10:51:20,600 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-08-05 10:51:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:20,601 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-08-05 10:51:20,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:51:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-08-05 10:51:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:51:20,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:20,602 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2019-08-05 10:51:20,602 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash 549673400, now seen corresponding path program 64 times [2019-08-05 10:51:20,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:20,637 WARN L254 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:51:20,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:21,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:21,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:21,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:21,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:21,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:21,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:21,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:21,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:21,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:22,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:22,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:22,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:22,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:22,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:22,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:22,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:22,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:22,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:23,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:23,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:23,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:23,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:23,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:23,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:23,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:23,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:24,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:24,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:24,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:24,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:24,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:24,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:51:24,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:51:24,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:51:24,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=8776, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:51:24,775 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 96 states. [2019-08-05 10:51:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:31,359 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-08-05 10:51:31,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:51:31,360 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 132 [2019-08-05 10:51:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:31,361 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:51:31,361 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:51:31,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2743 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=524, Invalid=16768, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:51:31,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:51:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-05 10:51:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 10:51:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-08-05 10:51:31,364 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-08-05 10:51:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:31,365 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-08-05 10:51:31,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:51:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-08-05 10:51:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:51:31,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:31,366 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2019-08-05 10:51:31,366 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash -44776226, now seen corresponding path program 65 times [2019-08-05 10:51:31,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:31,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:51:31,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:32,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:32,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:32,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:32,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:32,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:32,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:32,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:32,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:32,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:33,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:33,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:33,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:33,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:33,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:33,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:33,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:33,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:33,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:34,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:34,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:34,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:34,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:34,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:34,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:35,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:35,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:35,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:35,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:35,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:35,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:35,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:35,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:36,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:36,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:51:36,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:51:36,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:51:36,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=9341, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:51:36,077 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 99 states. [2019-08-05 10:51:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:43,029 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-05 10:51:43,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:51:43,030 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 134 [2019-08-05 10:51:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:43,031 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:51:43,031 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 10:51:43,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2904 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=536, Invalid=17286, Unknown=0, NotChecked=0, Total=17822 [2019-08-05 10:51:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 10:51:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-05 10:51:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:51:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-08-05 10:51:43,034 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-08-05 10:51:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:43,035 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-08-05 10:51:43,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:51:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-08-05 10:51:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 10:51:43,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:43,035 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2019-08-05 10:51:43,035 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:43,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:43,036 INFO L82 PathProgramCache]: Analyzing trace with hash -80216444, now seen corresponding path program 66 times [2019-08-05 10:51:43,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:43,068 WARN L254 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:51:43,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:44,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:44,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:44,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:44,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:44,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:44,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:44,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:45,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:45,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:45,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:45,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:45,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:45,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:45,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:45,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:45,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:45,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:46,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:46,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:46,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:46,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:46,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:46,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:46,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:46,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:47,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:47,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:47,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:47,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:47,595 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:47,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:47,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:48,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:48,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:48,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:48,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:51:48,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:51:48,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:51:48,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=9924, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:51:48,236 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 102 states. [2019-08-05 10:51:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:55,578 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-08-05 10:51:55,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:51:55,579 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 136 [2019-08-05 10:51:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:55,580 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:51:55,580 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:51:55,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3072 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=548, Invalid=17812, Unknown=0, NotChecked=0, Total=18360 [2019-08-05 10:51:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:51:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 10:51:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 10:51:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-08-05 10:51:55,584 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-08-05 10:51:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:55,584 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-08-05 10:51:55,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:51:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-08-05 10:51:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:51:55,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:55,585 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2019-08-05 10:51:55,585 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:55,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:55,585 INFO L82 PathProgramCache]: Analyzing trace with hash 221472426, now seen corresponding path program 67 times [2019-08-05 10:51:55,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:55,614 WARN L254 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:51:55,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:56,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:56,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:56,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:56,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:56,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:56,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:56,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:56,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:56,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:56,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:56,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:57,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:57,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:57,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:57,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:57,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:57,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:57,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:57,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:57,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:58,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:58,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:58,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:58,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:58,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:58,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:58,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:58,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:59,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:59,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:59,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:59,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:59,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:59,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:59,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:00,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:00,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:00,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:52:00,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:52:00,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:52:00,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=10525, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:52:00,164 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 105 states. [2019-08-05 10:52:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:07,410 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 10:52:07,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:52:07,411 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 138 [2019-08-05 10:52:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:07,412 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:52:07,412 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:52:07,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3247 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=560, Invalid=18346, Unknown=0, NotChecked=0, Total=18906 [2019-08-05 10:52:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:52:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-05 10:52:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:52:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-08-05 10:52:07,415 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-08-05 10:52:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:07,416 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-08-05 10:52:07,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:52:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-08-05 10:52:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:52:07,416 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:07,416 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2019-08-05 10:52:07,417 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:07,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1913299632, now seen corresponding path program 68 times [2019-08-05 10:52:07,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:07,453 WARN L254 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:52:07,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:08,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:08,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:08,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:08,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:08,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:08,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:08,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:08,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:08,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:08,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:08,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:08,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:08,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:09,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:09,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:09,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:09,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:09,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:09,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:09,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:09,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:09,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:10,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:10,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:10,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:10,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:10,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:11,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:11,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:11,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:11,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:11,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:11,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:11,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:12,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:12,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:12,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:12,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:12,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:12,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:52:12,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:52:12,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:52:12,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=11144, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:52:12,502 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 108 states. Received shutdown request... [2019-08-05 10:52:16,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:52:16,571 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:52:16,578 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:52:16,578 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:52:16 BoogieIcfgContainer [2019-08-05 10:52:16,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:52:16,580 INFO L168 Benchmark]: Toolchain (without parser) took 243059.50 ms. Allocated memory was 140.5 MB in the beginning and 484.4 MB in the end (delta: 343.9 MB). Free memory was 110.7 MB in the beginning and 315.1 MB in the end (delta: -204.4 MB). Peak memory consumption was 139.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:16,581 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:52:16,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.97 ms. Allocated memory is still 140.5 MB. Free memory was 110.5 MB in the beginning and 109.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:16,582 INFO L168 Benchmark]: Boogie Preprocessor took 24.21 ms. Allocated memory is still 140.5 MB. Free memory was 109.0 MB in the beginning and 107.7 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:52:16,582 INFO L168 Benchmark]: RCFGBuilder took 351.46 ms. Allocated memory is still 140.5 MB. Free memory was 107.7 MB in the beginning and 97.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:16,583 INFO L168 Benchmark]: TraceAbstraction took 242638.51 ms. Allocated memory was 140.5 MB in the beginning and 484.4 MB in the end (delta: 343.9 MB). Free memory was 97.2 MB in the beginning and 315.1 MB in the end (delta: -217.9 MB). Peak memory consumption was 126.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:16,586 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.97 ms. Allocated memory is still 140.5 MB. Free memory was 110.5 MB in the beginning and 109.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.21 ms. Allocated memory is still 140.5 MB. Free memory was 109.0 MB in the beginning and 107.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 351.46 ms. Allocated memory is still 140.5 MB. Free memory was 107.7 MB in the beginning and 97.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242638.51 ms. Allocated memory was 140.5 MB in the beginning and 484.4 MB in the end (delta: 343.9 MB). Free memory was 97.2 MB in the beginning and 315.1 MB in the end (delta: -217.9 MB). Peak memory consumption was 126.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (141states) and FLOYD_HOARE automaton (currently 37 states, 108 states before enhancement),while ReachableStatesComputation was computing reachable states (66 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 242.5s OverallTime, 69 OverallIterations, 69 TraceHistogramMax, 152.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 205 SDtfs, 35 SDslu, 1210 SDs, 0 SdLazy, 129303 SolverSat, 5237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 75.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7003 GetRequests, 2054 SyntacticMatches, 19 SemanticMatches, 4930 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65456 ImplicationChecksByTransitivity, 146.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 68 MinimizatonAttempts, 50 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 88.1s InterpolantComputationTime, 4968 NumberOfCodeBlocks, 4968 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 4899 ConstructedInterpolants, 0 QuantifiedInterpolants, 1731021 SizeOfPredicates, 295 NumberOfNonLiveVariables, 10488 ConjunctsInSsa, 3883 ConjunctsInUnsatCore, 69 InterpolantComputations, 1 PerfectInterpolantSequences, 0/109480 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown