java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/hhk2008.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:34:08,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:34:08,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:34:08,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:34:08,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:34:08,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:34:08,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:34:08,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:34:08,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:34:08,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:34:08,351 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:34:08,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:34:08,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:34:08,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:34:08,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:34:08,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:34:08,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:34:08,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:34:08,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:34:08,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:34:08,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:34:08,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:34:08,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:34:08,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:34:08,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:34:08,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:34:08,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:34:08,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:34:08,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:34:08,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:34:08,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:34:08,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:34:08,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:34:08,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:34:08,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:34:08,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:34:08,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:34:08,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:34:08,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:34:08,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:34:08,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:34:08,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:34:08,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:34:08,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:34:08,425 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:34:08,426 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:34:08,426 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/hhk2008.c.i_3.bpl [2019-08-04 21:34:08,427 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/hhk2008.c.i_3.bpl' [2019-08-04 21:34:08,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:34:08,466 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:34:08,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:34:08,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:34:08,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:34:08,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:08" (1/1) ... [2019-08-04 21:34:08,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:08" (1/1) ... [2019-08-04 21:34:08,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:34:08,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:34:08,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:34:08,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:34:08,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:08" (1/1) ... [2019-08-04 21:34:08,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:08" (1/1) ... [2019-08-04 21:34:08,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:08" (1/1) ... [2019-08-04 21:34:08,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:08" (1/1) ... [2019-08-04 21:34:08,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:08" (1/1) ... [2019-08-04 21:34:08,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:08" (1/1) ... [2019-08-04 21:34:08,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:08" (1/1) ... [2019-08-04 21:34:08,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:34:08,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:34:08,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:34:08,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:34:08,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:34:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:34:08,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:34:08,761 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:34:08,761 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:34:08,762 INFO L202 PluginConnector]: Adding new model hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:34:08 BoogieIcfgContainer [2019-08-04 21:34:08,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:34:08,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:34:08,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:34:08,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:34:08,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:08" (1/2) ... [2019-08-04 21:34:08,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f860a8 and model type hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:34:08, skipping insertion in model container [2019-08-04 21:34:08,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:34:08" (2/2) ... [2019-08-04 21:34:08,771 INFO L109 eAbstractionObserver]: Analyzing ICFG hhk2008.c.i_3.bpl [2019-08-04 21:34:08,781 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:34:08,788 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:34:08,804 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:34:08,834 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:34:08,835 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:34:08,835 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:34:08,835 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:34:08,836 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:34:08,836 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:34:08,836 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:34:08,837 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:34:08,837 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:34:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:34:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:34:08,864 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:08,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:34:08,867 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:08,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:08,873 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:34:08,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:08,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:34:08,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:09,108 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-04 21:34:09,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:34:09,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:34:09,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:34:09,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:34:09,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:34:09,140 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:34:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:09,200 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:34:09,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:34:09,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:34:09,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:09,212 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:34:09,213 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:34:09,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:34:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:34:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:34:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:34:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:34:09,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:34:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:09,250 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:34:09,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:34:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:34:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:34:09,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:09,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:34:09,251 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:09,252 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:34:09,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:09,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:34:09,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:09,545 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-04 21:34:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:09,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:09,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:34:09,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:34:09,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:34:09,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:34:09,573 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:34:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:09,617 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:34:09,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:34:09,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:34:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:09,618 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:34:09,618 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:34:09,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:34:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:34:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:34:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:34:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:34:09,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:34:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:09,622 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:34:09,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:34:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:34:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:34:09,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:09,623 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:34:09,623 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:09,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:09,624 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:34:09,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:09,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:34:09,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:09,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:09,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:09,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:34:09,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:34:09,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:34:09,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:34:09,807 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:34:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:09,892 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:34:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:34:09,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:34:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:09,893 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:34:09,893 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:34:09,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:34:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:34:09,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:34:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:34:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:34:09,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:34:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:09,897 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:34:09,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:34:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:34:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:34:09,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:09,898 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:34:09,898 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:09,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:09,899 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:34:09,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:09,934 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:34:09,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:10,190 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-04 21:34:10,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:10,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:34:10,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:34:10,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:34:10,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:34:10,192 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:34:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:10,304 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:34:10,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:34:10,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:34:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:10,305 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:34:10,306 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:34:10,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:34:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:34:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:34:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:34:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:34:10,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:34:10,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:10,308 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:34:10,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:34:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:34:10,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:34:10,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:10,309 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:34:10,310 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:10,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:10,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:34:10,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:10,333 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:34:10,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:10,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:10,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:34:10,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:34:10,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:34:10,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:34:10,537 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:34:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:10,703 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:34:10,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:34:10,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:34:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:10,706 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:34:10,707 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:34:10,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:34:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:34:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:34:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:34:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:34:10,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:34:10,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:10,712 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:34:10,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:34:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:34:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:34:10,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:10,713 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:34:10,713 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:10,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:10,714 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:34:10,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:10,754 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:34:10,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:10,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:10,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:34:10,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:34:10,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:34:10,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:34:10,911 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:34:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:10,999 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:34:10,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:34:11,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:34:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:11,001 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:34:11,001 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:34:11,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:34:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:34:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:34:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:34:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:34:11,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:34:11,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:11,005 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:34:11,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:34:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:34:11,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:34:11,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:11,006 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:34:11,006 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:11,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:34:11,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:11,027 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:34:11,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:11,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:11,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:34:11,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:34:11,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:34:11,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:34:11,449 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:34:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:11,591 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:34:11,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:34:11,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:34:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:11,593 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:34:11,593 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:34:11,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:34:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:34:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:34:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:34:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:34:11,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:34:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:11,596 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:34:11,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:34:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:34:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:34:11,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:11,597 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:34:11,598 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-04 21:34:11,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:11,622 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:34:11,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:11,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:11,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:34:11,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:34:11,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:34:11,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:34:11,834 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:34:11,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:11,939 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:34:11,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:34:11,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:34:11,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:11,941 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:34:11,941 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:34:11,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:34:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:34:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:34:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:34:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:34:11,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:34:11,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:11,944 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:34:11,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:34:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:34:11,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:34:11,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:11,945 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:34:11,946 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:11,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:11,946 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-04 21:34:11,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:11,968 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:34:11,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:12,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:12,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:34:12,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:34:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:34:12,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:34:12,295 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:34:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:12,426 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:34:12,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:34:12,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:34:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:12,428 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:34:12,429 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:34:12,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:34:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:34:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:34:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:34:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:34:12,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:34:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:12,432 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:34:12,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:34:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:34:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:34:12,433 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:12,433 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:34:12,434 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-04 21:34:12,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:12,455 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:34:12,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:12,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:12,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:34:12,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:34:12,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:34:12,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:34:12,688 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:34:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:12,795 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:34:12,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:34:12,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:34:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:12,797 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:34:12,798 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:34:12,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:34:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:34:12,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:34:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:34:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:34:12,800 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:34:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:12,801 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:34:12,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:34:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:34:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:34:12,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:12,802 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:34:12,802 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-04 21:34:12,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:12,822 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:34:12,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:13,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:13,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:34:13,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:34:13,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:34:13,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:34:13,049 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:34:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:13,202 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:34:13,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:34:13,205 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:34:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:13,206 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:34:13,206 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:34:13,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:34:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:34:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:34:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:34:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:34:13,209 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:34:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:13,209 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:34:13,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:34:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:34:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:34:13,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:13,210 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:34:13,211 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:13,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:13,211 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-04 21:34:13,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:13,242 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-04 21:34:13,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:13,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:13,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:34:13,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:34:13,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:34:13,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:34:13,488 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:34:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:13,651 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:34:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:34:13,651 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:34:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:13,652 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:34:13,652 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:34:13,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:34:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:34:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:34:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:34:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:34:13,654 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:34:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:13,655 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:34:13,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:34:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:34:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:34:13,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:13,655 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:34:13,656 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:13,656 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-04 21:34:13,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:13,675 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:34:13,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:14,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:14,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:34:14,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:34:14,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:34:14,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:34:14,085 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:34:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:14,282 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:34:14,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:34:14,287 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:34:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:14,288 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:34:14,288 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:34:14,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:34:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:34:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:34:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:34:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:34:14,291 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:34:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:14,292 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:34:14,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:34:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:34:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:34:14,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:14,293 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:34:14,293 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-04 21:34:14,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:14,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:34:14,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:14,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:14,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:34:14,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:34:14,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:34:14,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:34:14,643 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:34:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:14,841 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:34:14,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:34:14,841 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:34:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:14,842 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:34:14,842 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:34:14,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:34:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:34:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:34:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:34:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:34:14,846 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:34:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:14,847 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:34:14,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:34:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:34:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:34:14,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:14,847 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:34:14,848 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:14,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:14,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-04 21:34:14,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:14,865 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:34:14,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:15,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:15,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:34:15,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:34:15,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:34:15,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:34:15,494 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:34:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:15,993 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:34:15,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:34:15,994 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:34:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:15,994 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:34:15,994 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:34:15,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:34:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:34:15,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:34:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:34:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:34:15,998 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:34:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:15,999 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:34:15,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:34:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:34:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:34:16,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:16,000 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:34:16,000 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:16,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:16,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-04 21:34:16,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:16,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:34:16,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:16,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:16,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:34:16,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:34:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:34:16,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:34:16,473 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:34:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:16,717 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:34:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:34:16,717 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:34:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:16,718 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:34:16,719 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:34:16,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:34:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:34:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:34:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:34:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:34:16,722 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:34:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:16,723 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:34:16,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:34:16,723 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:34:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:34:16,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:16,724 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:34:16,724 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:16,724 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-04 21:34:16,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:16,738 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-04 21:34:16,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:17,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:17,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:34:17,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:34:17,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:34:17,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:34:17,071 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:34:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:17,334 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:34:17,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:34:17,335 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:34:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:17,336 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:34:17,336 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:34:17,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:34:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:34:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:34:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:34:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:34:17,339 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:34:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:17,339 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:34:17,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:34:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:34:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:34:17,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:17,340 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:34:17,340 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:17,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:17,341 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-04 21:34:17,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:17,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:34:17,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:17,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:17,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:34:17,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:34:17,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:34:17,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:34:17,667 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:34:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:18,002 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:34:18,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:34:18,003 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:34:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:18,004 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:34:18,004 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:34:18,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:34:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:34:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:34:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:34:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:34:18,007 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:34:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:18,008 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:34:18,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:34:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:34:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:34:18,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:18,009 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:34:18,009 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:18,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:18,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-04 21:34:18,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:18,024 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:34:18,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:18,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:18,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:34:18,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:34:18,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:34:18,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:34:18,545 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:34:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:18,895 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:34:18,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:34:18,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:34:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:18,897 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:34:18,897 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:34:18,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:34:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:34:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:34:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:34:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:34:18,901 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:34:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:18,902 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:34:18,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:34:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:34:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:34:18,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:18,903 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:34:18,903 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:18,903 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-04 21:34:18,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:18,919 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-04 21:34:18,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:19,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:19,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:34:19,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:34:19,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:34:19,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:34:19,275 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:34:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:19,689 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:34:19,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:34:19,689 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:34:19,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:19,690 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:34:19,690 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:34:19,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:34:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:34:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:34:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:34:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:34:19,694 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:34:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:19,695 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:34:19,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:34:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:34:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:34:19,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:19,696 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:34:19,696 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:19,696 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-04 21:34:19,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:19,713 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:34:19,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:20,333 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-04 21:34:20,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:20,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:34:20,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:34:20,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:34:20,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:34:20,335 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:34:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:20,895 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:34:20,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:34:20,896 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:34:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:20,896 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:34:20,897 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:34:20,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:34:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:34:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:34:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:34:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:34:20,901 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:34:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:20,901 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:34:20,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:34:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:34:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:34:20,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:20,902 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:34:20,902 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:20,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:20,903 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-04 21:34:20,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:20,917 WARN L254 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:34:20,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:21,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:21,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:34:21,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:34:21,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:34:21,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:34:21,382 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:34:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:21,811 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:34:21,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:34:21,813 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:34:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:21,813 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:34:21,814 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:34:21,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:34:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:34:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:34:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:34:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:34:21,817 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:34:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:21,817 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:34:21,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:34:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:34:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:34:21,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:21,818 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:34:21,818 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:21,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:21,819 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-04 21:34:21,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:21,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-04 21:34:21,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:22,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:22,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:34:22,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:34:22,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:34:22,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:34:22,457 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:34:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:23,232 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:34:23,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:34:23,234 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:34:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:23,235 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:34:23,235 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:34:23,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:34:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:34:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:34:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:34:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:34:23,238 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:34:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:23,238 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:34:23,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:34:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:34:23,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:34:23,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:23,239 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:34:23,239 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:23,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:23,239 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-04 21:34:23,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:23,254 WARN L254 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-04 21:34:23,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:24,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:24,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:34:24,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:34:24,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:34:24,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:34:24,511 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:34:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:25,176 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:34:25,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:34:25,177 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:34:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:25,177 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:34:25,178 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:34:25,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:34:25,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:34:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:34:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:34:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:34:25,182 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:34:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:25,182 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:34:25,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:34:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:34:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:34:25,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:25,183 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:34:25,184 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:25,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:25,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-04 21:34:25,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:25,201 WARN L254 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-04 21:34:25,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:26,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:26,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:34:26,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:34:26,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:34:26,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:34:26,294 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:34:26,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:26,821 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:34:26,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:34:26,821 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:34:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:26,822 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:34:26,822 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:34:26,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:34:26,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:34:26,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:34:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:34:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:34:26,826 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:34:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:26,826 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:34:26,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:34:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:34:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:34:26,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:26,827 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:34:26,828 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:26,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:26,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-04 21:34:26,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:26,844 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-04 21:34:26,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:27,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:27,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:34:27,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:34:27,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:34:27,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:34:27,405 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:34:28,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:28,876 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:34:28,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:34:28,877 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:34:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:28,877 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:34:28,878 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:34:28,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:34:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:34:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:34:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:34:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:34:28,882 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:34:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:28,882 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:34:28,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:34:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:34:28,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:34:28,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:28,883 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:34:28,883 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:28,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:28,884 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-04 21:34:28,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:28,899 WARN L254 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-04 21:34:28,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:29,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:29,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:34:29,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:34:29,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:34:29,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:34:29,485 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:34:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:30,070 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:34:30,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:34:30,070 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:34:30,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:30,071 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:34:30,071 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:34:30,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:34:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:34:30,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:34:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:34:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:34:30,075 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:34:30,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:30,075 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:34:30,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:34:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:34:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:34:30,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:30,076 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:34:30,076 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:30,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:30,077 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-04 21:34:30,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:30,092 WARN L254 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-04 21:34:30,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:30,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:30,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:34:30,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:34:30,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:34:30,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:34:30,807 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:34:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:31,479 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:34:31,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:34:31,479 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:34:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:31,480 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:34:31,480 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:34:31,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:34:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:34:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:34:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:34:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:34:31,485 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:34:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:31,485 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:34:31,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:34:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:34:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:34:31,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:31,486 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:34:31,486 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:31,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-04 21:34:31,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:31,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-04 21:34:31,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:32,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:32,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:34:32,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:34:32,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:34:32,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:34:32,085 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:34:32,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:32,790 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:34:32,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:34:32,790 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:34:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:32,791 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:34:32,791 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:34:32,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:34:32,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:34:32,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:34:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:34:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:34:32,795 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:34:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:32,795 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:34:32,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:34:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:34:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:34:32,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:32,796 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:34:32,796 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:32,797 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-04 21:34:32,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:32,815 WARN L254 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-04 21:34:32,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:33,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:33,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:34:33,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:34:33,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:34:33,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:34:33,641 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:34:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:34,421 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:34:34,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:34:34,422 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:34:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:34,423 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:34:34,423 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:34:34,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:34:34,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:34:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:34:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:34:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:34:34,427 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:34:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:34,427 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:34:34,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:34:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:34:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:34:34,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:34,428 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:34:34,428 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:34,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:34,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-04 21:34:34,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:34,444 WARN L254 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-04 21:34:34,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:35,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:35,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:34:35,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:34:35,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:34:35,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:34:35,136 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:34:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:36,076 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:34:36,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:34:36,077 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:34:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:36,078 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:34:36,078 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:34:36,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:34:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:34:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:34:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:34:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:34:36,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:34:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:36,081 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:34:36,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:34:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:34:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:34:36,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:36,082 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:34:36,082 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:36,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-04 21:34:36,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:36,100 WARN L254 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-04 21:34:36,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:36,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:36,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:34:36,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:34:36,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:34:36,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:34:36,916 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:34:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:37,725 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:34:37,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:34:37,726 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:34:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:37,726 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:34:37,726 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:34:37,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:34:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:34:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:34:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:34:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:34:37,732 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:34:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:37,732 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:34:37,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:34:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:34:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:34:37,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:37,733 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:34:37,733 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:37,733 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-04 21:34:37,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:37,752 WARN L254 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-04 21:34:37,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:38,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:38,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:34:38,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:34:38,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:34:38,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:34:38,527 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:34:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:39,417 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:34:39,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:34:39,418 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:34:39,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:39,418 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:34:39,418 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:34:39,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:34:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:34:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:34:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:34:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:34:39,422 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:34:39,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:39,422 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:34:39,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:34:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:34:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:34:39,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:39,423 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:34:39,424 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:39,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:39,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-04 21:34:39,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:39,444 WARN L254 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-04 21:34:39,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:40,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:40,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:34:40,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:34:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:34:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:34:40,340 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:34:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:41,437 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:34:41,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:34:41,437 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:34:41,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:41,438 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:34:41,438 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:34:41,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:34:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:34:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:34:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:34:41,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:34:41,441 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:34:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:41,442 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:34:41,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:34:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:34:41,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:34:41,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:41,443 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:34:41,443 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:41,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:41,443 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-04 21:34:41,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:41,462 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-04 21:34:41,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:42,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:42,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:34:42,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:34:42,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:34:42,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:34:42,351 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:34:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:43,316 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:34:43,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:34:43,317 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:34:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:43,318 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:34:43,318 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:34:43,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:34:43,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:34:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:34:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:34:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:34:43,321 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:34:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:43,322 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:34:43,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:34:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:34:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:34:43,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:43,322 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:34:43,323 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:43,323 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-04 21:34:43,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:43,343 WARN L254 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-04 21:34:43,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:44,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:44,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:34:44,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:34:44,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:34:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:34:44,807 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:34:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:45,810 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:34:45,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:34:45,811 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:34:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:45,812 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:34:45,812 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:34:45,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:34:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:34:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:34:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:34:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:34:45,815 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:34:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:45,815 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:34:45,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:34:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:34:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:34:45,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:45,816 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:34:45,816 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:45,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:45,816 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-04 21:34:45,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:45,836 WARN L254 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-04 21:34:45,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:46,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:46,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:34:46,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:34:46,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:34:46,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:34:46,872 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:34:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:47,942 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:34:47,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:34:47,942 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:34:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:47,943 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:34:47,943 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:34:47,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:34:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:34:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:34:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:34:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:34:47,946 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:34:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:47,947 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:34:47,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:34:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:34:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:34:47,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:47,947 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:34:47,948 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:47,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-04 21:34:47,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:47,968 WARN L254 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-04 21:34:47,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:48,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:48,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:34:48,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:34:48,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:34:48,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:34:48,871 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:34:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:50,004 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:34:50,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:34:50,005 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:34:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:50,006 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:34:50,006 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:34:50,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:34:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:34:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:34:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:34:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:34:50,009 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:34:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:50,009 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:34:50,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:34:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:34:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:34:50,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:50,010 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:34:50,011 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:50,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-04 21:34:50,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:50,029 WARN L254 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-04 21:34:50,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:50,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:50,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:34:50,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:34:50,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:34:50,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:34:50,968 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:34:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:52,352 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:34:52,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:34:52,353 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:34:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:52,353 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:34:52,354 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:34:52,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:34:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:34:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:34:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:34:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:34:52,356 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:34:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:52,357 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:34:52,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:34:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:34:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:34:52,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:52,357 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:34:52,357 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:52,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:52,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-04 21:34:52,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:52,378 WARN L254 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-04 21:34:52,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:53,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:53,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:34:53,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:34:53,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:34:53,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:34:53,370 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:34:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:54,636 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:34:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:34:54,637 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:34:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:54,637 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:34:54,637 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:34:54,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:34:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:34:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:34:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:34:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:34:54,640 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:34:54,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:54,641 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:34:54,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:34:54,641 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:34:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:34:54,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:54,641 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:34:54,642 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:54,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:54,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-04 21:34:54,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:54,664 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-04 21:34:54,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:55,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:55,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:34:55,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:34:55,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:34:55,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:34:55,675 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:34:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:57,144 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:34:57,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:34:57,145 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:34:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:57,146 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:34:57,146 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:34:57,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:34:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:34:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:34:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:34:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:34:57,148 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:34:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:57,149 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:34:57,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:34:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:34:57,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:34:57,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:57,149 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:34:57,150 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:57,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:57,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-04 21:34:57,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:57,171 WARN L254 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-04 21:34:57,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:58,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:58,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:34:58,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:34:58,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:34:58,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:34:58,301 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:34:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:59,676 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:34:59,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:34:59,677 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:34:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:59,677 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:34:59,677 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:34:59,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:34:59,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:34:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:34:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:34:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:34:59,680 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:34:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:59,681 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:34:59,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:34:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:34:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:34:59,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:59,682 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:34:59,682 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:59,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:59,682 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-04 21:34:59,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:59,706 WARN L254 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-04 21:34:59,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:00,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:00,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:35:00,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:35:00,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:35:00,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:35:00,837 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:35:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:02,458 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:35:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:35:02,459 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:35:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:02,459 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:35:02,459 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:35:02,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:35:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:35:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:35:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:35:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:35:02,463 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:35:02,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:02,463 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:35:02,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:35:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:35:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:35:02,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:02,464 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:35:02,464 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:02,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:02,464 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-04 21:35:02,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:02,487 WARN L254 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 181 conjunts are in the unsatisfiable core [2019-08-04 21:35:02,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:03,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:03,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:35:03,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:35:03,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:35:03,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:35:03,689 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:35:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:05,220 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:35:05,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:35:05,221 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:35:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:05,222 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:35:05,222 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:35:05,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:35:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:35:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:35:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:35:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:35:05,225 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:35:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:05,225 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:35:05,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:35:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:35:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:35:05,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:05,226 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:35:05,226 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:05,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:05,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-04 21:35:05,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:05,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-04 21:35:05,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:06,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:06,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:35:06,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:35:06,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:35:06,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:35:06,720 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:35:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:08,334 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:35:08,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:35:08,334 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:35:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:08,335 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:35:08,335 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:35:08,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:35:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:35:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:35:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:35:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:35:08,338 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:35:08,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:08,339 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:35:08,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:35:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:35:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:35:08,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:08,339 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:35:08,340 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-04 21:35:08,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:08,366 WARN L254 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-04 21:35:08,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:09,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:09,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:35:09,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:35:09,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:35:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:35:09,717 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:35:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:11,323 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:35:11,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:35:11,323 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:35:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:11,324 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:35:11,324 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:35:11,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:35:11,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:35:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:35:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:35:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:35:11,327 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:35:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:11,327 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:35:11,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:35:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:35:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:35:11,328 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:11,328 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:35:11,328 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:11,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:11,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-04 21:35:11,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:11,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 193 conjunts are in the unsatisfiable core [2019-08-04 21:35:11,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:13,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:13,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:35:13,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:35:13,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:35:13,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:35:13,008 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:35:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:14,723 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:35:14,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:35:14,724 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:35:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:14,724 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:35:14,725 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:35:14,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:35:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:35:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:35:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:35:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:35:14,727 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:35:14,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:14,727 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:35:14,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:35:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:35:14,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:35:14,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:14,728 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:35:14,728 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:14,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-04 21:35:14,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:14,757 WARN L254 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-04 21:35:14,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:16,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:16,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:35:16,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:35:16,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:35:16,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:35:16,221 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:35:18,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:18,084 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:35:18,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:35:18,084 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:35:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:18,085 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:35:18,085 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:35:18,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:35:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:35:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:35:18,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:35:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:35:18,088 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:35:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:18,089 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:35:18,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:35:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:35:18,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:35:18,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:18,090 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:35:18,090 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:18,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:18,090 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-04 21:35:18,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:18,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-04 21:35:18,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:19,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:19,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:35:19,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:35:19,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:35:19,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:35:19,659 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:35:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:21,512 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:35:21,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:35:21,512 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:35:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:21,513 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:35:21,513 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:35:21,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:35:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:35:21,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:35:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:35:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:35:21,516 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:35:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:21,517 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:35:21,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:35:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:35:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:35:21,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:21,517 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:35:21,518 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:21,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:21,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-04 21:35:21,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:21,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 205 conjunts are in the unsatisfiable core [2019-08-04 21:35:21,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:23,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:23,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:35:23,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:35:23,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:35:23,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:35:23,335 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:35:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:25,224 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:35:25,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:35:25,224 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:35:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:25,225 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:35:25,225 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:35:25,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:35:25,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:35:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:35:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:35:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:35:25,228 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:35:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:25,229 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:35:25,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:35:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:35:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:35:25,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:25,229 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:35:25,230 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:25,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:25,230 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-04 21:35:25,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:25,260 WARN L254 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-04 21:35:25,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:27,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:27,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:35:27,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:35:27,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:35:27,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:35:27,694 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:35:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:29,747 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:35:29,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:35:29,748 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:35:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:29,749 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:35:29,749 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:35:29,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:35:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:35:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:35:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:35:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:35:29,751 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:35:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:29,752 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:35:29,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:35:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:35:29,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:35:29,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:29,752 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:35:29,753 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:29,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:29,753 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-04 21:35:29,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:29,781 WARN L254 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-04 21:35:29,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:31,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:31,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:35:31,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:35:31,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:35:31,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:35:31,449 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:35:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:33,655 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:35:33,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:35:33,655 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:35:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:33,656 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:35:33,656 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:35:33,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:35:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:35:33,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:35:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:35:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:35:33,659 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:35:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:33,659 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:35:33,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:35:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:35:33,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:35:33,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:33,660 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:35:33,660 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:33,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-04 21:35:33,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:33,681 WARN L254 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 217 conjunts are in the unsatisfiable core [2019-08-04 21:35:33,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:35,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:35,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:35:35,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:35:35,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:35:35,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:35:35,243 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:35:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:37,568 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:35:37,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:35:37,569 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:35:37,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:37,570 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:35:37,570 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:35:37,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:35:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:35:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:35:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:35:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:35:37,573 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:35:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:37,574 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:35:37,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:35:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:35:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:35:37,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:37,575 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:35:37,575 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-04 21:35:37,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:37,612 WARN L254 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-04 21:35:37,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:40,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:40,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:35:40,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:35:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:35:40,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:35:40,182 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:35:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:42,499 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:35:42,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:35:42,499 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:35:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:42,500 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:35:42,500 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:35:42,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:35:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:35:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:35:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:35:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:35:42,502 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:35:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:42,502 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:35:42,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:35:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:35:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:35:42,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:42,503 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:35:42,503 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:42,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:42,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-04 21:35:42,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:42,536 WARN L254 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-04 21:35:42,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:44,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:44,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:35:44,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:35:44,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:35:44,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:35:44,333 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:35:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:46,678 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:35:46,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:35:46,678 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:35:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:46,679 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:35:46,679 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:35:46,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:35:46,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:35:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:35:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:35:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:35:46,682 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:35:46,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:46,682 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:35:46,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:35:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:35:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:35:46,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:46,684 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:35:46,684 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:46,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:46,684 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-04 21:35:46,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:46,719 WARN L254 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 229 conjunts are in the unsatisfiable core [2019-08-04 21:35:46,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:48,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:48,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:35:48,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:35:48,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:35:48,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:35:48,880 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:35:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:51,242 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:35:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:35:51,242 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:35:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:51,243 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:35:51,243 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:35:51,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:35:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:35:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:35:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:35:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:35:51,247 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:35:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:51,247 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:35:51,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:35:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:35:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:35:51,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:51,248 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:35:51,248 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:51,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:51,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-04 21:35:51,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:51,279 WARN L254 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-04 21:35:51,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:53,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:53,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:35:53,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:35:53,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:35:53,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:35:53,546 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:35:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:56,018 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:35:56,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:35:56,019 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:35:56,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:56,020 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:35:56,020 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:35:56,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:35:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:35:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:35:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:35:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:35:56,023 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:35:56,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:56,024 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:35:56,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:35:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:35:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:35:56,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:56,025 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:35:56,025 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:56,025 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-04 21:35:56,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:56,060 WARN L254 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-04 21:35:56,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:35:58,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:58,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:35:58,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:35:58,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:35:58,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:35:58,230 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:36:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:00,832 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:36:00,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:36:00,833 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:36:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:00,834 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:36:00,834 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:36:00,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:36:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:36:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:36:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:36:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:36:00,837 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:36:00,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:00,837 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:36:00,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:36:00,837 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:36:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:36:00,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:00,838 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:36:00,838 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:00,838 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-04 21:36:00,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:00,873 WARN L254 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 241 conjunts are in the unsatisfiable core [2019-08-04 21:36:00,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:02,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:02,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:36:02,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:36:02,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:36:02,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:36:02,993 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:36:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:05,648 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:36:05,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:36:05,648 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:36:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:05,649 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:36:05,649 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:36:05,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:36:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:36:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:36:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:36:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:36:05,652 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:36:05,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:05,652 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:36:05,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:36:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:36:05,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:36:05,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:05,653 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:36:05,653 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:05,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-04 21:36:05,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:05,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-04 21:36:05,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:07,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:07,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:36:07,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:36:07,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:36:07,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:36:07,800 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:36:10,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:10,545 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:36:10,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:36:10,545 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:36:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:10,546 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:36:10,546 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:36:10,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:36:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:36:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:36:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:36:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:36:10,549 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:36:10,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:10,549 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:36:10,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:36:10,549 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:36:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:36:10,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:10,550 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:36:10,550 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-04 21:36:10,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:10,588 WARN L254 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-04 21:36:10,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:12,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:12,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:36:12,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:36:12,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:36:12,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:36:12,716 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:36:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:15,691 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:36:15,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:36:15,692 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:36:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:15,693 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:36:15,693 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:36:15,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:36:15,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:36:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:36:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:36:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:36:15,695 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:36:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:15,696 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:36:15,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:36:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:36:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:36:15,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:15,697 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:36:15,697 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-04 21:36:15,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:15,736 WARN L254 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 253 conjunts are in the unsatisfiable core [2019-08-04 21:36:15,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:17,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:17,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:36:17,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:36:17,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:36:17,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:36:17,882 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:36:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:20,952 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:36:20,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:36:20,953 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:36:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:20,953 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:36:20,954 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:36:20,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:36:20,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:36:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:36:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:36:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:36:20,956 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:36:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:20,956 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:36:20,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:36:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:36:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:36:20,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:20,957 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:36:20,958 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:20,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:20,958 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-04 21:36:20,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:20,992 WARN L254 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-04 21:36:20,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:23,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:23,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:36:23,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:36:23,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:36:23,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:36:23,179 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:36:26,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:26,336 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:36:26,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:36:26,336 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:36:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:26,337 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:36:26,337 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:36:26,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:36:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:36:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:36:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:36:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:36:26,340 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-04 21:36:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:26,341 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:36:26,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:36:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:36:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:36:26,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:26,341 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:36:26,342 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:26,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:26,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-04 21:36:26,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:26,373 WARN L254 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-04 21:36:26,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:29,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:29,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:36:29,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:36:29,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:36:29,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:36:29,151 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-04 21:36:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:32,320 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:36:32,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:36:32,321 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:36:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:32,321 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:36:32,322 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:36:32,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:36:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:36:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:36:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:36:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:36:32,325 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-04 21:36:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:32,325 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:36:32,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:36:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:36:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:36:32,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:32,326 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:36:32,326 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:32,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:32,326 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-04 21:36:32,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:32,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 265 conjunts are in the unsatisfiable core [2019-08-04 21:36:32,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:35,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:35,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:36:35,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:36:35,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:36:35,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:36:35,002 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-04 21:36:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:38,179 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:36:38,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:36:38,179 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:36:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:38,180 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:36:38,180 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:36:38,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:36:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:36:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:36:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:36:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:36:38,183 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-04 21:36:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:38,183 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:36:38,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:36:38,183 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:36:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:36:38,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:38,184 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:36:38,184 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:38,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-04 21:36:38,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:38,220 WARN L254 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-04 21:36:38,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:40,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:40,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:36:40,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:36:40,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:36:40,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:36:40,875 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-04 21:36:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:44,311 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:36:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:36:44,312 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:36:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:44,313 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:36:44,313 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:36:44,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:36:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:36:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:36:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:36:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:36:44,315 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-04 21:36:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:44,316 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:36:44,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:36:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:36:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:36:44,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:44,317 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:36:44,317 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-04 21:36:44,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:44,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-04 21:36:44,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:46,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:46,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:36:46,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:36:46,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:36:46,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:36:46,939 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-04 21:36:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:50,584 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:36:50,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:36:50,585 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:36:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:50,585 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:36:50,586 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:36:50,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:36:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:36:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:36:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:36:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:36:50,588 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-04 21:36:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:50,589 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:36:50,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:36:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:36:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:36:50,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:50,590 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:36:50,590 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:50,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-04 21:36:50,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:50,621 WARN L254 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 277 conjunts are in the unsatisfiable core [2019-08-04 21:36:50,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:53,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:53,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:36:53,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:36:53,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:36:53,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:36:53,136 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-04 21:36:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:56,730 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:36:56,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:36:56,730 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:36:56,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:56,731 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:36:56,731 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:36:56,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:36:56,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:36:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:36:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:36:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:36:56,734 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-04 21:36:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:56,734 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:36:56,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:36:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:36:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:36:56,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:56,734 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:36:56,735 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:56,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:56,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-04 21:36:56,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:56,775 WARN L254 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-04 21:36:56,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:00,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:00,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:37:00,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:37:00,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:37:00,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:37:00,504 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-04 21:37:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:04,188 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:37:04,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:37:04,188 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:37:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:04,189 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:37:04,189 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:37:04,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:37:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:37:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:37:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:37:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:37:04,191 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-04 21:37:04,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:04,191 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:37:04,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:37:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:37:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:37:04,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:04,192 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:37:04,193 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:04,193 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-04 21:37:04,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:04,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-04 21:37:04,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:07,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:07,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:37:07,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:37:07,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:37:07,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:37:07,132 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-04 21:37:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:11,043 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:37:11,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:37:11,044 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:37:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:11,045 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:37:11,045 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:37:11,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:37:11,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:37:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:37:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:37:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:37:11,048 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-04 21:37:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:11,048 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:37:11,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:37:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:37:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:37:11,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:11,049 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:37:11,050 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:11,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-04 21:37:11,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:11,108 WARN L254 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 289 conjunts are in the unsatisfiable core [2019-08-04 21:37:11,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:13,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:13,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:37:13,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:37:13,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:37:13,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:37:13,949 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-04 21:37:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:17,880 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:37:17,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:37:17,881 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:37:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:17,882 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:37:17,882 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:37:17,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:37:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:37:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:37:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:37:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:37:17,885 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-04 21:37:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:17,885 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:37:17,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:37:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:37:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:37:17,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:17,886 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:37:17,886 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:17,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:17,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-04 21:37:17,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:17,947 WARN L254 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-04 21:37:17,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:21,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:21,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:37:21,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:37:21,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:37:21,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:37:21,319 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-04 21:37:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:25,459 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:37:25,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:37:25,460 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:37:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:25,461 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:37:25,461 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:37:25,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:37:25,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:37:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:37:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:37:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:37:25,464 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-04 21:37:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:25,464 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:37:25,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:37:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:37:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:37:25,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:25,465 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:37:25,465 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:25,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-04 21:37:25,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:25,518 WARN L254 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-04 21:37:25,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:28,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:28,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:37:28,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:37:28,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:37:28,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:37:28,482 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-04 21:37:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:32,653 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:37:32,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:37:32,654 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:37:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:32,654 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:37:32,655 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:37:32,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:37:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:37:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:37:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:37:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:37:32,658 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-04 21:37:32,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:32,658 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:37:32,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:37:32,658 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:37:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:37:32,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:32,659 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:37:32,659 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:32,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:32,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-04 21:37:32,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:32,702 WARN L254 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 301 conjunts are in the unsatisfiable core [2019-08-04 21:37:32,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:36,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:36,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:37:36,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:37:36,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:37:36,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:37:36,021 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-04 21:37:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:40,274 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:37:40,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:37:40,274 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:37:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:40,275 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:37:40,275 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:37:40,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:37:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:37:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:37:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:37:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:37:40,278 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-04 21:37:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:40,278 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:37:40,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:37:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:37:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:37:40,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:40,279 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:37:40,279 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:40,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:40,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-04 21:37:40,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:40,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-04 21:37:40,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:43,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:43,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:37:43,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:37:43,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:37:43,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:37:43,927 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-04 21:37:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:48,417 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:37:48,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:37:48,417 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:37:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:48,418 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:37:48,418 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:37:48,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:37:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:37:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:37:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:37:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:37:48,421 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-04 21:37:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:48,421 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:37:48,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:37:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:37:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:37:48,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:48,422 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:37:48,422 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:48,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-04 21:37:48,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:48,460 WARN L254 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 309 conjunts are in the unsatisfiable core [2019-08-04 21:37:48,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:51,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:51,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:37:51,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:37:51,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:37:51,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:37:51,804 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-04 21:37:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:56,292 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:37:56,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:37:56,293 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:37:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:56,293 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:37:56,294 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:37:56,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:37:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:37:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:37:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:37:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:37:56,296 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-04 21:37:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:56,296 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:37:56,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:37:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:37:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:37:56,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:56,297 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:37:56,297 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:56,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:56,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-04 21:37:56,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:56,362 WARN L254 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 313 conjunts are in the unsatisfiable core [2019-08-04 21:37:56,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:00,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:00,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:38:00,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:38:00,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:38:00,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:38:00,060 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-04 21:38:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:04,924 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-04 21:38:04,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:38:04,925 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-04 21:38:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:04,926 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:38:04,926 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:38:04,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:38:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:38:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:38:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:38:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:38:04,929 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-04 21:38:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:04,929 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:38:04,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:38:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:38:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:38:04,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:04,930 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-04 21:38:04,930 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:04,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:04,930 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-04 21:38:04,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:04,989 WARN L254 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-04 21:38:04,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:08,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:08,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:38:08,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:38:08,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:38:08,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:38:08,515 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-04 21:38:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:13,755 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-04 21:38:13,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:38:13,756 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-04 21:38:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:13,757 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:38:13,757 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:38:13,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:38:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:38:13,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:38:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:38:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-04 21:38:13,760 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-04 21:38:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:13,760 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-04 21:38:13,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:38:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-04 21:38:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-04 21:38:13,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:13,761 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-04 21:38:13,761 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-04 21:38:13,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:13,813 WARN L254 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 321 conjunts are in the unsatisfiable core [2019-08-04 21:38:13,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:17,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:17,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:38:17,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:38:17,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:38:17,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:38:17,343 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. Received shutdown request... [2019-08-04 21:38:20,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:38:20,615 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:38:20,622 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:38:20,622 INFO L202 PluginConnector]: Adding new model hhk2008.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:38:20 BoogieIcfgContainer [2019-08-04 21:38:20,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:38:20,624 INFO L168 Benchmark]: Toolchain (without parser) took 252157.85 ms. Allocated memory was 141.0 MB in the beginning and 223.9 MB in the end (delta: 82.8 MB). Free memory was 110.7 MB in the beginning and 59.5 MB in the end (delta: 51.2 MB). Peak memory consumption was 134.0 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:20,625 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 141.0 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:38:20,625 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.47 ms. Allocated memory is still 141.0 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-04 21:38:20,626 INFO L168 Benchmark]: Boogie Preprocessor took 20.17 ms. Allocated memory is still 141.0 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-04 21:38:20,627 INFO L168 Benchmark]: RCFGBuilder took 239.88 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 98.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:20,627 INFO L168 Benchmark]: TraceAbstraction took 251858.19 ms. Allocated memory was 141.0 MB in the beginning and 223.9 MB in the end (delta: 82.8 MB). Free memory was 97.9 MB in the beginning and 59.5 MB in the end (delta: 38.4 MB). Peak memory consumption was 121.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:20,630 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.25 ms. Allocated memory is still 141.0 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.47 ms. Allocated memory is still 141.0 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 20.17 ms. Allocated memory is still 141.0 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 239.88 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 98.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251858.19 ms. Allocated memory was 141.0 MB in the beginning and 223.9 MB in the end (delta: 82.8 MB). Free memory was 97.9 MB in the beginning and 59.5 MB in the end (delta: 38.4 MB). Peak memory consumption was 121.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 47). Cancelled while BasicCegarLoop was constructing difference of abstraction (82states) and FLOYD_HOARE automaton (currently 55 states, 81 states before enhancement),while ReachableStatesComputation was computing reachable states (53 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 251.7s OverallTime, 79 OverallIterations, 78 TraceHistogramMax, 135.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 235 SDtfs, 0 SDslu, 3081 SDs, 0 SdLazy, 171587 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3239 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 111.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 78 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 114.1s InterpolantComputationTime, 3318 NumberOfCodeBlocks, 3318 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 3239 ConstructedInterpolants, 0 QuantifiedInterpolants, 1877040 SizeOfPredicates, 474 NumberOfNonLiveVariables, 17380 ConjunctsInSsa, 13035 ConjunctsInUnsatCore, 79 InterpolantComputations, 1 PerfectInterpolantSequences, 0/82160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown