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/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:35:01,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:35:01,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:35:01,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:35:01,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:35:01,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:35:01,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:35:01,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:35:01,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:35:01,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:35:01,354 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:35:01,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:35:01,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:35:01,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:35:01,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:35:01,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:35:01,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:35:01,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:35:01,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:35:01,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:35:01,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:35:01,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:35:01,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:35:01,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:35:01,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:35:01,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:35:01,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:35:01,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:35:01,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:35:01,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:35:01,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:35:01,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:35:01,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:35:01,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:35:01,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:35:01,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:35:01,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:35:01,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:35:01,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:35:01,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:35:01,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:35:01,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:35:01,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:35:01,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:35:01,427 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:35:01,427 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:35:01,428 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl [2019-08-05 10:35:01,428 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl' [2019-08-05 10:35:01,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:35:01,460 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:35:01,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:35:01,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:35:01,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:35:01,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:01" (1/1) ... [2019-08-05 10:35:01,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:01" (1/1) ... [2019-08-05 10:35:01,493 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:35:01,493 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:35:01,493 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:35:01,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:35:01,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:35:01,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:35:01,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:35:01,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:01" (1/1) ... [2019-08-05 10:35:01,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:01" (1/1) ... [2019-08-05 10:35:01,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:01" (1/1) ... [2019-08-05 10:35:01,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:01" (1/1) ... [2019-08-05 10:35:01,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:01" (1/1) ... [2019-08-05 10:35:01,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:01" (1/1) ... [2019-08-05 10:35:01,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:01" (1/1) ... [2019-08-05 10:35:01,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:35:01,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:35:01,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:35:01,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:35:01,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:35:01,594 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:35:01,595 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:35:01,595 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:35:01,795 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:35:01,795 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:35:01,796 INFO L202 PluginConnector]: Adding new model MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:35:01 BoogieIcfgContainer [2019-08-05 10:35:01,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:35:01,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:35:01,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:35:01,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:35:01,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:01" (1/2) ... [2019-08-05 10:35:01,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625b4a74 and model type MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:35:01, skipping insertion in model container [2019-08-05 10:35:01,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:35:01" (2/2) ... [2019-08-05 10:35:01,805 INFO L109 eAbstractionObserver]: Analyzing ICFG MonadicInvariant01.bpl [2019-08-05 10:35:01,814 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:35:01,822 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:35:01,838 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:35:01,864 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:35:01,865 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:35:01,865 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:35:01,865 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:35:01,865 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:35:01,866 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:35:01,866 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:35:01,866 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:35:01,866 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:35:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:35:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:35:01,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:01,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:35:01,891 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:01,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:01,897 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 10:35:01,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:01,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:35:01,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:02,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:35:02,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:35:02,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:35:02,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:35:02,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:35:02,062 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:35:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:02,129 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:35:02,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:35:02,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:35:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:02,142 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:35:02,142 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:35:02,144 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-05 10:35:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:35:02,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:35:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:35:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:35:02,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 10:35:02,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:02,178 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:35:02,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:35:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:35:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:35:02,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:02,179 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:35:02,180 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:02,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:02,180 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-08-05 10:35:02,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:02,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:35:02,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:02,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:02,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:35:02,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:35:02,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:35:02,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:35:02,381 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-08-05 10:35:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:02,429 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:35:02,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:35:02,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:35:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:02,431 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:35:02,431 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:35:02,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:35:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:35:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:35:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:35:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:35:02,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 10:35:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:02,436 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:35:02,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:35:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:35:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:35:02,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:02,437 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 10:35:02,438 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:02,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:02,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-08-05 10:35:02,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:02,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:35:02,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:02,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:02,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:35:02,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:35:02,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:35:02,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:35:02,558 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-05 10:35:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:02,616 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:35:02,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:35:02,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:35:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:02,617 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:35:02,618 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:35:02,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:35:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:35:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:35:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:35:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:35:02,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 10:35:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:02,621 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:35:02,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:35:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:35:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:35:02,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:02,623 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-08-05 10:35:02,623 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:02,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:02,623 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-08-05 10:35:02,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:02,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:35:02,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:02,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:02,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:35:02,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:35:02,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:35:02,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:35:02,932 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2019-08-05 10:35:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:02,977 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:35:02,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:35:02,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:35:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:02,978 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:35:02,978 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:35:02,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:35:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:35:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:35:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:35:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:35:02,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:35:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:02,982 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:35:02,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:35:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:35:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:35:02,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:02,983 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-08-05 10:35:02,983 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:02,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:02,984 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-08-05 10:35:02,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:02,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:35:02,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:03,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:03,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:35:03,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:35:03,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:35:03,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:35:03,172 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2019-08-05 10:35:03,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:03,233 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:35:03,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:35:03,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:35:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:03,237 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:35:03,237 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:35:03,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:35:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:35:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:35:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:35:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:35:03,243 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 10:35:03,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:03,243 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:35:03,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:35:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:35:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:35:03,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:03,244 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-08-05 10:35:03,244 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-08-05 10:35:03,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:03,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:35:03,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:03,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:03,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:35:03,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:35:03,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:35:03,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:35:03,497 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2019-08-05 10:35:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:03,602 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:35:03,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:35:03,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 10:35:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:03,610 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:35:03,611 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:35:03,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:35:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:35:03,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:35:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:35:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:35:03,614 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 10:35:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:03,617 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:35:03,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:35:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:35:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:35:03,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:03,618 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-08-05 10:35:03,618 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:03,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-08-05 10:35:03,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:03,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:35:03,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:03,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:03,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:35:03,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:35:03,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:35:03,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:35:03,866 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-08-05 10:35:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:03,918 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:35:03,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:35:03,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:35:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:03,920 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:35:03,921 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:35:03,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:35:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:35:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:35:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:35:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:35:03,924 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 10:35:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:03,925 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:35:03,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:35:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:35:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:35:03,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:03,926 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-08-05 10:35:03,926 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:03,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-08-05 10:35:03,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:03,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:35:03,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:04,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:04,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:35:04,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:35:04,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:35:04,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:35:04,381 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2019-08-05 10:35:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:04,470 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:35:04,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:35:04,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 10:35:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:04,471 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:35:04,471 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:35:04,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:35:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:35:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:35:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:35:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:35:04,475 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 10:35:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:04,475 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:35:04,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:35:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:35:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:35:04,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:04,476 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-08-05 10:35:04,476 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:04,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-08-05 10:35:04,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:04,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:35:04,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:04,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:04,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:35:04,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:35:04,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:35:04,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:04,719 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2019-08-05 10:35:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:04,777 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:35:04,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:35:04,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 10:35:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:04,779 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:35:04,779 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:35:04,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:35:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:35:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:35:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:35:04,784 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 10:35:04,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:04,784 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:35:04,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:35:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:35:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:35:04,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:04,786 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-08-05 10:35:04,786 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:04,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:04,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-08-05 10:35:04,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:04,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:35:04,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:05,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:05,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:35:05,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:35:05,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:35:05,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:05,082 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-08-05 10:35:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:05,157 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:35:05,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:35:05,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 10:35:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:05,158 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:35:05,158 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:35:05,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:05,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:35:05,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:35:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:35:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:35:05,162 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 10:35:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:05,163 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:35:05,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:35:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:35:05,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:35:05,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:05,164 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-08-05 10:35:05,164 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:05,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:05,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-08-05 10:35:05,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:05,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:35:05,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:05,337 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:05,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:05,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:35:05,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:35:05,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:35:05,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:05,338 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 13 states. [2019-08-05 10:35:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:05,397 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:35:05,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:35:05,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-08-05 10:35:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:05,399 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:35:05,399 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:35:05,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:35:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:35:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:35:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:35:05,404 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 10:35:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:05,404 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:35:05,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:35:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:35:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:35:05,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:05,405 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-08-05 10:35:05,406 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:05,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:05,406 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-08-05 10:35:05,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:05,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:35:05,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:05,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:05,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:35:05,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:35:05,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:35:05,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:05,604 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-08-05 10:35:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:05,662 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:35:05,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:35:05,662 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-08-05 10:35:05,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:05,663 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:35:05,663 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:35:05,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:35:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:35:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:35:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:35:05,667 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 10:35:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:05,668 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:35:05,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:35:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:35:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:35:05,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:05,669 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-08-05 10:35:05,669 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:05,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-08-05 10:35:05,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:05,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:35:05,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:06,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:06,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:35:06,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:35:06,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:35:06,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:06,081 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 15 states. [2019-08-05 10:35:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:06,289 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:35:06,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:35:06,290 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-08-05 10:35:06,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:06,291 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:35:06,291 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:35:06,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:35:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:35:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:35:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:35:06,296 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 10:35:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:06,296 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:35:06,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:35:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:35:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:35:06,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:06,297 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-08-05 10:35:06,298 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-08-05 10:35:06,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:06,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:35:06,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:06,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:06,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:35:06,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:35:06,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:35:06,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:06,804 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 16 states. [2019-08-05 10:35:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:07,090 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:35:07,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:35:07,091 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-08-05 10:35:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:07,091 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:35:07,092 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:35:07,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:35:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:35:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:35:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:35:07,097 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 10:35:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:07,097 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:35:07,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:35:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:35:07,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:35:07,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:07,099 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-08-05 10:35:07,099 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:07,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:07,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-08-05 10:35:07,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:07,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:35:07,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:07,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:07,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:35:07,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:35:07,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:35:07,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:07,536 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 17 states. [2019-08-05 10:35:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:07,599 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:35:07,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:35:07,601 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-08-05 10:35:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:07,602 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:35:07,602 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:35:07,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:35:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:35:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:35:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:35:07,606 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 10:35:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:07,606 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:35:07,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:35:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:35:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:35:07,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:07,607 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-08-05 10:35:07,608 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:07,608 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-08-05 10:35:07,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:07,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:35:07,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:07,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:07,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:35:07,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:35:07,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:35:07,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:07,857 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 18 states. [2019-08-05 10:35:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:08,050 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:35:08,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:35:08,050 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-08-05 10:35:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:08,051 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:35:08,051 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:35:08,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:35:08,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:35:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:35:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:35:08,055 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 10:35:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:08,056 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:35:08,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:35:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:35:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:35:08,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:08,057 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-08-05 10:35:08,057 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:08,059 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-08-05 10:35:08,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:08,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:35:08,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:08,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:08,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:35:08,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:35:08,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:35:08,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:08,416 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 19 states. [2019-08-05 10:35:08,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:08,485 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:35:08,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:35:08,486 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-08-05 10:35:08,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:08,487 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:35:08,487 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:35:08,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:35:08,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:35:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:35:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:35:08,492 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 10:35:08,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:08,492 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:35:08,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:35:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:35:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:35:08,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:08,493 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-08-05 10:35:08,493 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-08-05 10:35:08,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:08,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:35:08,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:08,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:08,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:35:08,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:35:08,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:35:08,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:08,793 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2019-08-05 10:35:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:08,899 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:35:08,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:35:08,899 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-08-05 10:35:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:08,900 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:35:08,900 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:35:08,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:35:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:35:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:35:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:35:08,905 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 10:35:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:08,905 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:35:08,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:35:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:35:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:35:08,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:08,906 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-08-05 10:35:08,907 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:08,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:08,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-08-05 10:35:08,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:08,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:35:08,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:09,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:09,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:35:09,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:35:09,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:35:09,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:09,338 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 21 states. [2019-08-05 10:35:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:09,444 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:35:09,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:35:09,445 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-08-05 10:35:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:09,445 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:35:09,446 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:35:09,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:35:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:35:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:35:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:35:09,450 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 10:35:09,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:09,451 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:35:09,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:35:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:35:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:35:09,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:09,452 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-08-05 10:35:09,452 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:09,453 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-08-05 10:35:09,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:09,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:35:09,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:09,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:09,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:35:09,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:35:09,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:35:09,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:09,877 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2019-08-05 10:35:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:09,954 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:35:09,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:35:09,954 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-08-05 10:35:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:09,955 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:35:09,955 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:35:09,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:35:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:35:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:35:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:35:09,961 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 10:35:09,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:09,961 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:35:09,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:35:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:35:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:35:09,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:09,962 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-08-05 10:35:09,962 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:09,963 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-08-05 10:35:09,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:09,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:35:09,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:10,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:10,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:35:10,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:35:10,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:35:10,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:10,338 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 23 states. [2019-08-05 10:35:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:10,409 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:35:10,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:35:10,410 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-08-05 10:35:10,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:10,410 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:35:10,411 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:35:10,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:35:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:35:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:35:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:35:10,415 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 10:35:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:10,416 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:35:10,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:35:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:35:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:35:10,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:10,417 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-08-05 10:35:10,417 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:10,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-08-05 10:35:10,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:10,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:35:10,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:10,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:10,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:35:10,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:35:10,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:35:10,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:10,916 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 24 states. [2019-08-05 10:35:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:11,000 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:35:11,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:35:11,010 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-08-05 10:35:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:11,011 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:35:11,011 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:35:11,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:35:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:35:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:35:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:35:11,015 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 10:35:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:11,015 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:35:11,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:35:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:35:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:35:11,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:11,017 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-08-05 10:35:11,017 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:11,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:11,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-08-05 10:35:11,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:11,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:35:11,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:11,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:11,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:35:11,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:35:11,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:35:11,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:11,618 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 25 states. [2019-08-05 10:35:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:11,723 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:35:11,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:35:11,723 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-08-05 10:35:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:11,724 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:35:11,724 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:35:11,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:35:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:35:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:35:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:35:11,728 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 10:35:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:11,729 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:35:11,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:35:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:35:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:35:11,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:11,730 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-08-05 10:35:11,730 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:11,730 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-08-05 10:35:11,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:11,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:35:11,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:12,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:12,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:35:12,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:35:12,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:35:12,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:12,228 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 26 states. [2019-08-05 10:35:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:12,350 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:35:12,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:35:12,350 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-08-05 10:35:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:12,351 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:35:12,352 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:35:12,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:12,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:35:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:35:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:35:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:35:12,356 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 10:35:12,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:12,356 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:35:12,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:35:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:35:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:35:12,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:12,357 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-08-05 10:35:12,358 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:12,358 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-08-05 10:35:12,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:12,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:35:12,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:12,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:12,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:35:12,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:35:12,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:35:12,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:12,960 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 27 states. [2019-08-05 10:35:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:13,033 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:35:13,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:35:13,034 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-08-05 10:35:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:13,035 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:35:13,035 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:35:13,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:35:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:35:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:35:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:35:13,039 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 10:35:13,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:13,039 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:35:13,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:35:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:35:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:35:13,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:13,040 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-08-05 10:35:13,040 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:13,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-08-05 10:35:13,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:13,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:35:13,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:13,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:13,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:35:13,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:35:13,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:35:13,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:13,643 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 28 states. [2019-08-05 10:35:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:13,759 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:35:13,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:35:13,760 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-08-05 10:35:13,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:13,761 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:35:13,761 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:35:13,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:35:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:35:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:35:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:35:13,765 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 10:35:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:13,765 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:35:13,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:35:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:35:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:35:13,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:13,768 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-08-05 10:35:13,768 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:13,768 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-08-05 10:35:13,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:13,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:35:13,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:14,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:14,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:35:14,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:35:14,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:35:14,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:14,509 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 29 states. [2019-08-05 10:35:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:14,589 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:35:14,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:35:14,589 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-08-05 10:35:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:14,590 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:35:14,590 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:35:14,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:35:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:35:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:35:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:35:14,594 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 10:35:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:14,594 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:35:14,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:35:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:35:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:35:14,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:14,595 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-08-05 10:35:14,595 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:14,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-08-05 10:35:14,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:14,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:35:14,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:15,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:15,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:35:15,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:35:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:35:15,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:15,136 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 30 states. [2019-08-05 10:35:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:15,240 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:35:15,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:35:15,240 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-08-05 10:35:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:15,241 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:35:15,241 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:35:15,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:35:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:35:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:35:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:35:15,244 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 10:35:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:15,245 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:35:15,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:35:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:35:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:35:15,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:15,246 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-08-05 10:35:15,246 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:15,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-08-05 10:35:15,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:15,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:35:15,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:17,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:17,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:35:17,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:35:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:35:17,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:17,195 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 31 states. [2019-08-05 10:35:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:17,325 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:35:17,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:35:17,325 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-08-05 10:35:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:17,326 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:35:17,326 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:35:17,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:35:17,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:35:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:35:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:35:17,330 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 10:35:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:17,331 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:35:17,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:35:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:35:17,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:35:17,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:17,332 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-08-05 10:35:17,332 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:17,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:17,332 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-08-05 10:35:17,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:17,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:35:17,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:17,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:17,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:35:17,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:35:17,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:35:17,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:17,984 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 32 states. [2019-08-05 10:35:18,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:18,133 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:35:18,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:35:18,134 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-08-05 10:35:18,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:18,135 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:35:18,135 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:35:18,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:35:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:35:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:35:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:35:18,138 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 10:35:18,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:18,138 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:35:18,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:35:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:35:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:35:18,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:18,139 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-08-05 10:35:18,139 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:18,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-08-05 10:35:18,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:18,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:35:18,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:18,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:18,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:35:18,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:35:18,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:35:18,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:18,760 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 33 states. [2019-08-05 10:35:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:18,900 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:35:18,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:35:18,901 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-08-05 10:35:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:18,902 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:35:18,902 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:35:18,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:18,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:35:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:35:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:35:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:35:18,905 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 10:35:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:18,906 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:35:18,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:35:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:35:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:35:18,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:18,907 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-08-05 10:35:18,907 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:18,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:18,907 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-08-05 10:35:18,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:18,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:35:18,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:20,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:20,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:35:20,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:35:20,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:35:20,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:35:20,153 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 34 states. [2019-08-05 10:35:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:20,256 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:35:20,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:35:20,257 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2019-08-05 10:35:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:20,258 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:35:20,258 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:35:20,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:35:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:35:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:35:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:35:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:35:20,262 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 10:35:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:20,262 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:35:20,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:35:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:35:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:35:20,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:20,263 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-08-05 10:35:20,263 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:20,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:20,263 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-08-05 10:35:20,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:20,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:35:20,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:20,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:20,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:35:20,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:35:20,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:35:20,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:35:20,974 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 35 states. [2019-08-05 10:35:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:21,129 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:35:21,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:35:21,130 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-08-05 10:35:21,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:21,131 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:35:21,131 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:35:21,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:35:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:35:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:35:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:35:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:35:21,135 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 10:35:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:21,135 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:35:21,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:35:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:35:21,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:35:21,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:21,147 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-08-05 10:35:21,147 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:21,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-08-05 10:35:21,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:21,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:35:21,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:22,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:22,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:35:22,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:35:22,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:35:22,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:35:22,092 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 36 states. [2019-08-05 10:35:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:22,203 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:35:22,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:35:22,204 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2019-08-05 10:35:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:22,205 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:35:22,205 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:35:22,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:35:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:35:22,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:35:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:35:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:35:22,209 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-08-05 10:35:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:22,209 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:35:22,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:35:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:35:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:35:22,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:22,210 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-08-05 10:35:22,210 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:22,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:22,210 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-08-05 10:35:22,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:22,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:35:22,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:23,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:23,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:35:23,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:35:23,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:35:23,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:35:23,063 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 37 states. [2019-08-05 10:35:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:23,201 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:35:23,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:35:23,201 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-08-05 10:35:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:23,202 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:35:23,202 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:35:23,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:35:23,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:35:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:35:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:35:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:35:23,206 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-08-05 10:35:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:23,206 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:35:23,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:35:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:35:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:35:23,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:23,207 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-08-05 10:35:23,208 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:23,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:23,208 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-08-05 10:35:23,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:23,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:35:23,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:24,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:24,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:35:24,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:35:24,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:35:24,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:35:24,064 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 38 states. [2019-08-05 10:35:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:24,175 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:35:24,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:35:24,175 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-08-05 10:35:24,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:24,177 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:35:24,177 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:35:24,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:35:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:35:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:35:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:35:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:35:24,180 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-08-05 10:35:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:24,181 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:35:24,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:35:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:35:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:35:24,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:24,182 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-08-05 10:35:24,182 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:24,182 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-08-05 10:35:24,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:24,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:35:24,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:25,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:25,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:35:25,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:35:25,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:35:25,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:35:25,055 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 39 states. [2019-08-05 10:35:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:25,169 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:35:25,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:35:25,170 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-08-05 10:35:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:25,171 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:35:25,171 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:35:25,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:35:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:35:25,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:35:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:35:25,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:35:25,175 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-08-05 10:35:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:25,176 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:35:25,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:35:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:35:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:35:25,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:25,176 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-08-05 10:35:25,177 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-08-05 10:35:25,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:25,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:35:25,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:25,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:25,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:35:25,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:35:25,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:35:25,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:35:25,946 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 40 states. [2019-08-05 10:35:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:26,076 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:35:26,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:35:26,076 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2019-08-05 10:35:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:26,077 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:35:26,077 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:35:26,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:35:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:35:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:35:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:35:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:35:26,082 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-08-05 10:35:26,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:26,082 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:35:26,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:35:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:35:26,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:35:26,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:26,083 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-08-05 10:35:26,083 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:26,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-08-05 10:35:26,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:26,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:35:26,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:27,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:27,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:35:27,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:35:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:35:27,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:35:27,239 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 41 states. [2019-08-05 10:35:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:27,381 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:35:27,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:35:27,382 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-08-05 10:35:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:27,383 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:35:27,383 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:35:27,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:35:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:35:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:35:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:35:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:35:27,386 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-08-05 10:35:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:27,387 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:35:27,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:35:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:35:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:35:27,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:27,388 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-08-05 10:35:27,388 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:27,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-08-05 10:35:27,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:27,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:35:27,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:28,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:28,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:35:28,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:35:28,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:35:28,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:35:28,237 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 42 states. [2019-08-05 10:35:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:28,406 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:35:28,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:35:28,406 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2019-08-05 10:35:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:28,407 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:35:28,407 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:35:28,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:35:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:35:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:35:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:35:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:35:28,411 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-08-05 10:35:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:28,412 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:35:28,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:35:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:35:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:35:28,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:28,412 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-08-05 10:35:28,413 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:28,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:28,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-08-05 10:35:28,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:28,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:35:28,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:29,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:29,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:35:29,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:35:29,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:35:29,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:35:29,304 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 43 states. [2019-08-05 10:35:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:29,438 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:35:29,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:35:29,438 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-08-05 10:35:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:29,439 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:35:29,440 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:35:29,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:35:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:35:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:35:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:35:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:35:29,444 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-08-05 10:35:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:29,444 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:35:29,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:35:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:35:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:35:29,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:29,445 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-08-05 10:35:29,445 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:29,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:29,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-08-05 10:35:29,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:29,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:35:29,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:30,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:30,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:35:30,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:35:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:35:30,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:35:30,518 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 44 states. [2019-08-05 10:35:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:30,640 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:35:30,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:35:30,641 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2019-08-05 10:35:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:30,642 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:35:30,642 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:35:30,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:35:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:35:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:35:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:35:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:35:30,647 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-08-05 10:35:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:30,647 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:35:30,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:35:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:35:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:35:30,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:30,648 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-08-05 10:35:30,648 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:30,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:30,648 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-08-05 10:35:30,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:30,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:35:30,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:31,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:31,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:35:31,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:35:31,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:35:31,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:35:31,770 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 45 states. [2019-08-05 10:35:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:31,944 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:35:31,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:35:31,945 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-08-05 10:35:31,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:31,945 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:35:31,945 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:35:31,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:35:31,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:35:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:35:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:35:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:35:31,949 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-08-05 10:35:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:31,949 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:35:31,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:35:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:35:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:35:31,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:31,950 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-08-05 10:35:31,950 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:31,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:31,950 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-08-05 10:35:31,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:31,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:35:31,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:33,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:33,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:35:33,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:35:33,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:35:33,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:35:33,056 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 46 states. [2019-08-05 10:35:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:33,192 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:35:33,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:35:33,192 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2019-08-05 10:35:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:33,193 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:35:33,193 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:35:33,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:35:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:35:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:35:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:35:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:35:33,197 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-08-05 10:35:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:33,197 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:35:33,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:35:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:35:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:35:33,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:33,198 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-08-05 10:35:33,198 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:33,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:33,198 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-08-05 10:35:33,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:33,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:35:33,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:34,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:34,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:35:34,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:35:34,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:35:34,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:35:34,168 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 47 states. [2019-08-05 10:35:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:34,602 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:35:34,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:35:34,603 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-08-05 10:35:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:34,604 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:35:34,604 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:35:34,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:35:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:35:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:35:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:35:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:35:34,608 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-08-05 10:35:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:34,608 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:35:34,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:35:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:35:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:35:34,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:34,609 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-08-05 10:35:34,609 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:34,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-08-05 10:35:34,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:34,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:35:34,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:35,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:35,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:35:35,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:35:35,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:35:35,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:35:35,767 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 48 states. [2019-08-05 10:35:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:35,903 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:35:35,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:35:35,903 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-08-05 10:35:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:35,904 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:35:35,904 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:35:35,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:35:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:35:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:35:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:35:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:35:35,908 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-08-05 10:35:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:35,908 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:35:35,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:35:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:35:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:35:35,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:35,909 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-08-05 10:35:35,909 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:35,910 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-08-05 10:35:35,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:35,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:35:35,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:37,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:37,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:35:37,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:35:37,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:35:37,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:35:37,389 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 49 states. [2019-08-05 10:35:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:37,528 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:35:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:35:37,529 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-08-05 10:35:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:37,530 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:35:37,530 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:35:37,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:35:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:35:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:35:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:35:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:35:37,534 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-08-05 10:35:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:37,534 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:35:37,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:35:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:35:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:35:37,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:37,535 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-08-05 10:35:37,535 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:37,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-08-05 10:35:37,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:37,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:35:37,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:38,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:38,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:35:38,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:35:38,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:35:38,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:35:38,870 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 50 states. [2019-08-05 10:35:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:39,013 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:35:39,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:35:39,013 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2019-08-05 10:35:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:39,014 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:35:39,015 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:35:39,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:35:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:35:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:35:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:35:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:35:39,018 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-08-05 10:35:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:39,019 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:35:39,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:35:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:35:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:35:39,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:39,019 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-08-05 10:35:39,020 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:39,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-08-05 10:35:39,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:39,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:35:39,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:40,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:40,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:35:40,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:35:40,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:35:40,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:35:40,378 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 51 states. [2019-08-05 10:35:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:40,526 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:35:40,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:35:40,527 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-08-05 10:35:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:40,528 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:35:40,528 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:35:40,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:35:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:35:40,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:35:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:35:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:35:40,532 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-08-05 10:35:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:40,532 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:35:40,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:35:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:35:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:35:40,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:40,533 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-08-05 10:35:40,533 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:40,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-08-05 10:35:40,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:40,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:35:40,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:43,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:43,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:35:43,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:35:43,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:35:43,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:35:43,187 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 52 states. [2019-08-05 10:35:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:43,377 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:35:43,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:35:43,377 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2019-08-05 10:35:43,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:43,379 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:35:43,379 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:35:43,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:35:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:35:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:35:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:35:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:35:43,383 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-08-05 10:35:43,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:43,383 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:35:43,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:35:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:35:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:35:43,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:43,384 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-08-05 10:35:43,384 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:43,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:43,385 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-08-05 10:35:43,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:43,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:35:43,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:44,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:44,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:35:44,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:35:44,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:35:44,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:35:44,700 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 53 states. [2019-08-05 10:35:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:44,870 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:35:44,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:35:44,870 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-08-05 10:35:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:44,872 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:35:44,872 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:35:44,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:35:44,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:35:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:35:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:35:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:35:44,875 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-08-05 10:35:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:44,876 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:35:44,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:35:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:35:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:35:44,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:44,877 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-08-05 10:35:44,877 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:44,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-08-05 10:35:44,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:44,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:35:44,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:46,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:46,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:35:46,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:35:46,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:35:46,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:35:46,585 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 54 states. [2019-08-05 10:35:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:46,755 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:35:46,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:35:46,755 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2019-08-05 10:35:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:46,757 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:35:46,757 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:35:46,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:35:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:35:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:35:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:35:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:35:46,760 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-08-05 10:35:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:46,761 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:35:46,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:35:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:35:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:35:46,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:46,762 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-08-05 10:35:46,762 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:46,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-08-05 10:35:46,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:46,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:35:46,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:48,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:48,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:35:48,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:35:48,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:35:48,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:35:48,384 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 55 states. [2019-08-05 10:35:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:48,555 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:35:48,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:35:48,555 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-08-05 10:35:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:48,556 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:35:48,556 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:35:48,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:35:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:35:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:35:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:35:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:35:48,560 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-08-05 10:35:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:48,560 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:35:48,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:35:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:35:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:35:48,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:48,561 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-08-05 10:35:48,561 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:48,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:48,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-08-05 10:35:48,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:48,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:35:48,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:50,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:50,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:35:50,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:35:50,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:35:50,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:35:50,364 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 56 states. [2019-08-05 10:35:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:50,548 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:35:50,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:35:50,549 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2019-08-05 10:35:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:50,550 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:35:50,550 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:35:50,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:35:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:35:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:35:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:35:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:35:50,553 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-08-05 10:35:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:50,554 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:35:50,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:35:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:35:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:35:50,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:50,555 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-08-05 10:35:50,555 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:50,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:50,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-08-05 10:35:50,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:50,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:35:50,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:52,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:52,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:35:52,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:35:52,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:35:52,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:35:52,228 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 57 states. [2019-08-05 10:35:52,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:52,512 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:35:52,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:35:52,512 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2019-08-05 10:35:52,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:52,513 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:35:52,513 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:35:52,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:35:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:35:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:35:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:35:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:35:52,516 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-08-05 10:35:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:52,516 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:35:52,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:35:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:35:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:35:52,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:52,517 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-08-05 10:35:52,517 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:52,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-08-05 10:35:52,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:52,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:35:52,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:54,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:54,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:35:54,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:35:54,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:35:54,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:35:54,154 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 58 states. [2019-08-05 10:35:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:54,694 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:35:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:35:54,694 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2019-08-05 10:35:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:54,695 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:35:54,695 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:35:54,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:35:54,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:35:54,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:35:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:35:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:35:54,698 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-08-05 10:35:54,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:54,698 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:35:54,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:35:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:35:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:35:54,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:54,699 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-08-05 10:35:54,699 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:54,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:54,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-08-05 10:35:54,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:54,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:35:54,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:56,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:56,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:35:56,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:35:56,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:35:56,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:35:56,272 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 59 states. [2019-08-05 10:35:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:56,454 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:35:56,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:35:56,454 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 115 [2019-08-05 10:35:56,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:56,455 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:35:56,456 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:35:56,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:35:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:35:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:35:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:35:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:35:56,459 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-08-05 10:35:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:56,459 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:35:56,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:35:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:35:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:35:56,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:56,460 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-08-05 10:35:56,460 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:56,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:56,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-08-05 10:35:56,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:56,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:35:56,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:58,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:58,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:35:58,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:35:58,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:35:58,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:35:58,343 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 60 states. [2019-08-05 10:35:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:58,521 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:35:58,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:35:58,521 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2019-08-05 10:35:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:58,522 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:35:58,522 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:35:58,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:35:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:35:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:35:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:35:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:35:58,526 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-08-05 10:35:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:58,527 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:35:58,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:35:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:35:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:35:58,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:58,528 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-08-05 10:35:58,528 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:58,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-08-05 10:35:58,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:58,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:35:58,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:00,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:00,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:36:00,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:36:00,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:36:00,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:36:00,471 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 61 states. [2019-08-05 10:36:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:00,659 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:36:00,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:36:00,659 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 119 [2019-08-05 10:36:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:00,660 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:36:00,660 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:36:00,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:36:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:36:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 10:36:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:36:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 10:36:00,664 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-08-05 10:36:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:00,664 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 10:36:00,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:36:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 10:36:00,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:36:00,665 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:00,665 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-08-05 10:36:00,665 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:00,665 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-08-05 10:36:00,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:00,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:36:00,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:02,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:02,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:36:02,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:36:02,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:36:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:36:02,288 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 62 states. [2019-08-05 10:36:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:02,484 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 10:36:02,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:36:02,485 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2019-08-05 10:36:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:02,486 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:36:02,486 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:36:02,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:36:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:36:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 10:36:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:36:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 10:36:02,489 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-08-05 10:36:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:02,490 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 10:36:02,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:36:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 10:36:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:36:02,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:02,491 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-08-05 10:36:02,491 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:02,491 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-08-05 10:36:02,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:02,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:36:02,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:04,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:04,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:36:04,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:36:04,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:36:04,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:36:04,547 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 63 states. [2019-08-05 10:36:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:04,762 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-08-05 10:36:04,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:36:04,763 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 123 [2019-08-05 10:36:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:04,764 INFO L225 Difference]: With dead ends: 126 [2019-08-05 10:36:04,764 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:36:04,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:36:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:36:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-08-05 10:36:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 10:36:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-08-05 10:36:04,767 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-08-05 10:36:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:04,767 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-08-05 10:36:04,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:36:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-08-05 10:36:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 10:36:04,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:04,768 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-08-05 10:36:04,768 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:04,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:04,769 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-08-05 10:36:04,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:04,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:36:04,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:06,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:06,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:36:06,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:36:06,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:36:06,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:36:06,514 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 64 states. [2019-08-05 10:36:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:06,738 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-08-05 10:36:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:36:06,739 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2019-08-05 10:36:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:06,740 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:36:06,740 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:36:06,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:36:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:36:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-08-05 10:36:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 10:36:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-05 10:36:06,743 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-08-05 10:36:06,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:06,744 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-05 10:36:06,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:36:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-05 10:36:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:36:06,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:06,744 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-08-05 10:36:06,745 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:06,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:06,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-08-05 10:36:06,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:06,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:36:06,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:08,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:08,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:36:08,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:36:08,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:36:08,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:36:08,783 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 65 states. [2019-08-05 10:36:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:08,971 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-08-05 10:36:08,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:36:08,972 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 127 [2019-08-05 10:36:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:08,973 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:36:08,974 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:36:08,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:36:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:36:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-08-05 10:36:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 10:36:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-08-05 10:36:08,977 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-08-05 10:36:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:08,977 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-08-05 10:36:08,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:36:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-08-05 10:36:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 10:36:08,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:08,978 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-08-05 10:36:08,978 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:08,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:08,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-08-05 10:36:08,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:08,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:36:08,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:10,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:10,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:36:10,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:36:10,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:36:10,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:36:10,865 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 66 states. [2019-08-05 10:36:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:11,077 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-08-05 10:36:11,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:36:11,078 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2019-08-05 10:36:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:11,079 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:36:11,079 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:36:11,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:36:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:36:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 10:36:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:36:11,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 10:36:11,083 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-08-05 10:36:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:11,083 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 10:36:11,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:36:11,084 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 10:36:11,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:36:11,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:11,084 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-08-05 10:36:11,085 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:11,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:11,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-08-05 10:36:11,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:11,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:36:11,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:13,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:13,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:36:13,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:36:13,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:36:13,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:36:13,373 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 67 states. [2019-08-05 10:36:13,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:13,570 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-08-05 10:36:13,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:36:13,571 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 131 [2019-08-05 10:36:13,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:13,572 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:36:13,572 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:36:13,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:36:13,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:36:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-08-05 10:36:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:36:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-05 10:36:13,575 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-08-05 10:36:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:13,576 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-05 10:36:13,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:36:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-05 10:36:13,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:36:13,576 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:13,577 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-08-05 10:36:13,577 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:13,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:13,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-08-05 10:36:13,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:13,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:36:13,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:15,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:15,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:36:15,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:36:15,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:36:15,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:36:15,561 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 68 states. [2019-08-05 10:36:15,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:15,761 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-08-05 10:36:15,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:36:15,761 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2019-08-05 10:36:15,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:15,762 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:36:15,762 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:36:15,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:36:15,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:36:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-08-05 10:36:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:36:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-08-05 10:36:15,765 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-08-05 10:36:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:15,766 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-08-05 10:36:15,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:36:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-08-05 10:36:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 10:36:15,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:15,766 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-08-05 10:36:15,767 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:15,767 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-08-05 10:36:15,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:15,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:36:15,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:17,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:17,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:36:17,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:36:17,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:36:17,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:36:17,964 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 69 states. [2019-08-05 10:36:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:18,345 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-08-05 10:36:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:36:18,345 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 135 [2019-08-05 10:36:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:18,346 INFO L225 Difference]: With dead ends: 138 [2019-08-05 10:36:18,346 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 10:36:18,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:36:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 10:36:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-08-05 10:36:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:36:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-08-05 10:36:18,350 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-08-05 10:36:18,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:18,351 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-08-05 10:36:18,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:36:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-08-05 10:36:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 10:36:18,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:18,351 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-08-05 10:36:18,352 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2019-08-05 10:36:18,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:18,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:36:18,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:22,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:22,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:36:22,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:36:22,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:36:22,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:36:22,336 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 70 states. [2019-08-05 10:36:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:22,863 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-08-05 10:36:22,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:36:22,863 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2019-08-05 10:36:22,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:22,864 INFO L225 Difference]: With dead ends: 140 [2019-08-05 10:36:22,865 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:36:22,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:36:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:36:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-08-05 10:36:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:36:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 10:36:22,868 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2019-08-05 10:36:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:22,869 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 10:36:22,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:36:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 10:36:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:36:22,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:22,870 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2019-08-05 10:36:22,870 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:22,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:22,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2019-08-05 10:36:22,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:22,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:36:22,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:25,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:25,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:36:25,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:36:25,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:36:25,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:36:25,269 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 71 states. [2019-08-05 10:36:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:25,539 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2019-08-05 10:36:25,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:36:25,540 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 139 [2019-08-05 10:36:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:25,541 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:36:25,541 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:36:25,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:36:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:36:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-08-05 10:36:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 10:36:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-08-05 10:36:25,544 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2019-08-05 10:36:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:25,544 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-08-05 10:36:25,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:36:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-08-05 10:36:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:36:25,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:25,545 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2019-08-05 10:36:25,545 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:25,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:25,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2019-08-05 10:36:25,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:25,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:36:25,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:27,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:27,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:36:27,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:36:27,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:36:27,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:36:27,687 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 72 states. [2019-08-05 10:36:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:27,912 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-08-05 10:36:27,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:36:27,913 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2019-08-05 10:36:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:27,914 INFO L225 Difference]: With dead ends: 144 [2019-08-05 10:36:27,914 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 10:36:27,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:36:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 10:36:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-08-05 10:36:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:36:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2019-08-05 10:36:27,917 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2019-08-05 10:36:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:27,917 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2019-08-05 10:36:27,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:36:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2019-08-05 10:36:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:36:27,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:27,918 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2019-08-05 10:36:27,918 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:27,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2019-08-05 10:36:27,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:27,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:36:27,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:30,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:30,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:36:30,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:36:30,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:36:30,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:36:30,545 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 73 states. [2019-08-05 10:36:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:30,767 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-08-05 10:36:30,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:36:30,767 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 143 [2019-08-05 10:36:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:30,768 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:36:30,768 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 10:36:30,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:36:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 10:36:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-08-05 10:36:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:36:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-08-05 10:36:30,771 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-08-05 10:36:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:30,772 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-08-05 10:36:30,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:36:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-08-05 10:36:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 10:36:30,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:30,773 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2019-08-05 10:36:30,773 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:30,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:30,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2019-08-05 10:36:30,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:30,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:36:30,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:33,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:33,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:36:33,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:36:33,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:36:33,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:36:33,087 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 74 states. [2019-08-05 10:36:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:33,377 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-08-05 10:36:33,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:36:33,377 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2019-08-05 10:36:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:33,378 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:36:33,378 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:36:33,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:36:33,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:36:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:36:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:36:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 10:36:33,381 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-08-05 10:36:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:33,381 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 10:36:33,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:36:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 10:36:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:36:33,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:33,382 INFO L399 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2019-08-05 10:36:33,382 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:33,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2019-08-05 10:36:33,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:33,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:36:33,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:36,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:36,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:36:36,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:36:36,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:36:36,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:36:36,601 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 75 states. [2019-08-05 10:36:36,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:36,866 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-08-05 10:36:36,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:36:36,866 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 147 [2019-08-05 10:36:36,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:36,867 INFO L225 Difference]: With dead ends: 150 [2019-08-05 10:36:36,868 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 10:36:36,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:36:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 10:36:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-08-05 10:36:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 10:36:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-08-05 10:36:36,871 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-08-05 10:36:36,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:36,871 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-08-05 10:36:36,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:36:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-08-05 10:36:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 10:36:36,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:36,872 INFO L399 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2019-08-05 10:36:36,873 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:36,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:36,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2019-08-05 10:36:36,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:36,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:36:36,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:39,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:39,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:36:39,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:36:39,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:36:39,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:36:39,577 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 76 states. [2019-08-05 10:36:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:39,878 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2019-08-05 10:36:39,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:36:39,879 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2019-08-05 10:36:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:39,880 INFO L225 Difference]: With dead ends: 152 [2019-08-05 10:36:39,880 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 10:36:39,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:36:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 10:36:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-08-05 10:36:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 10:36:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-08-05 10:36:39,883 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-08-05 10:36:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:39,883 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-08-05 10:36:39,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:36:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-08-05 10:36:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 10:36:39,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:39,884 INFO L399 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2019-08-05 10:36:39,885 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:39,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:39,885 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2019-08-05 10:36:39,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:39,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:36:39,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:42,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:42,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:36:42,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:36:42,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:36:42,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:36:42,496 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 77 states. [2019-08-05 10:36:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:42,737 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2019-08-05 10:36:42,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:36:42,738 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 151 [2019-08-05 10:36:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:42,739 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:36:42,739 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:36:42,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:36:42,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:36:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-08-05 10:36:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 10:36:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-08-05 10:36:42,742 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-08-05 10:36:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:42,743 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-08-05 10:36:42,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:36:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-08-05 10:36:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 10:36:42,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:42,743 INFO L399 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2019-08-05 10:36:42,744 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:42,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:42,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2019-08-05 10:36:42,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:42,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:36:42,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:45,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:45,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:36:45,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:36:45,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:36:45,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:36:45,922 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 78 states. [2019-08-05 10:36:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:46,172 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-08-05 10:36:46,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:36:46,172 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2019-08-05 10:36:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:46,174 INFO L225 Difference]: With dead ends: 156 [2019-08-05 10:36:46,174 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 10:36:46,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:36:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 10:36:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-08-05 10:36:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:36:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-08-05 10:36:46,177 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-08-05 10:36:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:46,177 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-08-05 10:36:46,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:36:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-08-05 10:36:46,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 10:36:46,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:46,178 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2019-08-05 10:36:46,179 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:46,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:46,179 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2019-08-05 10:36:46,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:46,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:36:46,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:49,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:49,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:36:49,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:36:49,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:36:49,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:36:49,118 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 79 states. [2019-08-05 10:36:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:49,371 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-08-05 10:36:49,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:36:49,371 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-08-05 10:36:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:49,373 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:36:49,373 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:36:49,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:36:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:36:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-08-05 10:36:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 10:36:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-08-05 10:36:49,376 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-08-05 10:36:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:49,376 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-08-05 10:36:49,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:36:49,376 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-08-05 10:36:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 10:36:49,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:49,377 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2019-08-05 10:36:49,377 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:49,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:49,378 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2019-08-05 10:36:49,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:49,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:36:49,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:52,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:52,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:36:52,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:36:52,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:36:52,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:36:52,044 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 80 states. [2019-08-05 10:36:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:52,295 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-08-05 10:36:52,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:36:52,295 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 157 [2019-08-05 10:36:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:52,297 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:36:52,297 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 10:36:52,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:36:52,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 10:36:52,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-08-05 10:36:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:36:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-08-05 10:36:52,300 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-08-05 10:36:52,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:52,301 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-08-05 10:36:52,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:36:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-08-05 10:36:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 10:36:52,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:52,302 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2019-08-05 10:36:52,302 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:52,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:52,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2019-08-05 10:36:52,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:52,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:36:52,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:55,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:55,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:36:55,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:36:55,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:36:55,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:36:55,350 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 81 states. [2019-08-05 10:36:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:55,643 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-08-05 10:36:55,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:36:55,643 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 159 [2019-08-05 10:36:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:55,645 INFO L225 Difference]: With dead ends: 162 [2019-08-05 10:36:55,645 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 10:36:55,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:36:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 10:36:55,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-08-05 10:36:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 10:36:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-08-05 10:36:55,649 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-08-05 10:36:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:55,649 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-08-05 10:36:55,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:36:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-08-05 10:36:55,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 10:36:55,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:55,650 INFO L399 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2019-08-05 10:36:55,650 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:55,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:55,651 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2019-08-05 10:36:55,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:55,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:36:55,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:58,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:58,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:36:58,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:36:58,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:36:58,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:36:58,517 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 82 states. [2019-08-05 10:36:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:58,774 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2019-08-05 10:36:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:36:58,775 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 161 [2019-08-05 10:36:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:58,776 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:36:58,776 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 10:36:58,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:36:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 10:36:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-05 10:36:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:36:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 10:36:58,780 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-08-05 10:36:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:58,780 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 10:36:58,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:36:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 10:36:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:36:58,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:58,782 INFO L399 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2019-08-05 10:36:58,782 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:58,782 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2019-08-05 10:36:58,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:58,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:36:58,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:01,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:01,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:37:01,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:37:01,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:37:01,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:37:01,764 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 83 states. [2019-08-05 10:37:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:02,031 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-08-05 10:37:02,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:37:02,031 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 163 [2019-08-05 10:37:02,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:02,032 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:37:02,032 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:37:02,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:37:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:37:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-08-05 10:37:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 10:37:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-08-05 10:37:02,036 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-08-05 10:37:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:02,036 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-08-05 10:37:02,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:37:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-08-05 10:37:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 10:37:02,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:02,037 INFO L399 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2019-08-05 10:37:02,037 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2019-08-05 10:37:02,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:02,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:37:02,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:05,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:05,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:37:05,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:37:05,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:37:05,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:37:05,522 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 84 states. [2019-08-05 10:37:05,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:05,783 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-08-05 10:37:05,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:37:05,783 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 165 [2019-08-05 10:37:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:05,784 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:37:05,785 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:37:05,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:37:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:37:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-08-05 10:37:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:37:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-08-05 10:37:05,788 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-08-05 10:37:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:05,788 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-08-05 10:37:05,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:37:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-08-05 10:37:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 10:37:05,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:05,789 INFO L399 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2019-08-05 10:37:05,790 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:05,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:05,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2019-08-05 10:37:05,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:05,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:37:05,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:09,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:09,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:37:09,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:37:09,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:37:09,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:37:09,120 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 85 states. [2019-08-05 10:37:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:09,482 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-08-05 10:37:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:37:09,483 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 167 [2019-08-05 10:37:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:09,484 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:37:09,484 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 10:37:09,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:37:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 10:37:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-08-05 10:37:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 10:37:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-08-05 10:37:09,487 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-08-05 10:37:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:09,488 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-08-05 10:37:09,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:37:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-08-05 10:37:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 10:37:09,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:09,489 INFO L399 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2019-08-05 10:37:09,489 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:09,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2019-08-05 10:37:09,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:09,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:37:09,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:12,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:12,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:37:12,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:37:12,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:37:12,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:37:12,638 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 86 states. [2019-08-05 10:37:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:12,909 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2019-08-05 10:37:12,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:37:12,909 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2019-08-05 10:37:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:12,910 INFO L225 Difference]: With dead ends: 172 [2019-08-05 10:37:12,911 INFO L226 Difference]: Without dead ends: 172 [2019-08-05 10:37:12,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:37:12,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-08-05 10:37:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-08-05 10:37:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:37:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-08-05 10:37:12,913 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-08-05 10:37:12,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:12,913 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-08-05 10:37:12,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:37:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-08-05 10:37:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:37:12,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:12,914 INFO L399 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2019-08-05 10:37:12,914 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:12,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2019-08-05 10:37:12,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:12,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:37:12,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:16,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:16,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:37:16,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:37:16,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:37:16,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:37:16,272 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 87 states. [2019-08-05 10:37:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:16,541 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-08-05 10:37:16,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:37:16,542 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 171 [2019-08-05 10:37:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:16,543 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:37:16,543 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:37:16,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:37:16,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:37:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-08-05 10:37:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 10:37:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-08-05 10:37:16,547 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-08-05 10:37:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:16,547 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-08-05 10:37:16,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:37:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-08-05 10:37:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:37:16,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:16,549 INFO L399 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2019-08-05 10:37:16,549 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:16,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:16,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2019-08-05 10:37:16,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:16,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:37:16,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:20,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:20,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:37:20,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:37:20,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:37:20,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:37:20,059 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 88 states. [2019-08-05 10:37:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:20,359 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-08-05 10:37:20,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:37:20,360 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 173 [2019-08-05 10:37:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:20,361 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:37:20,361 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:37:20,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:37:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:37:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-08-05 10:37:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 10:37:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-08-05 10:37:20,365 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-08-05 10:37:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:20,366 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-08-05 10:37:20,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:37:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-08-05 10:37:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:37:20,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:20,367 INFO L399 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2019-08-05 10:37:20,367 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2019-08-05 10:37:20,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:20,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:37:20,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:23,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:23,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:37:23,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:37:23,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:37:23,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:37:23,738 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 89 states. [2019-08-05 10:37:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:24,010 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2019-08-05 10:37:24,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:37:24,011 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 175 [2019-08-05 10:37:24,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:24,012 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:37:24,012 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 10:37:24,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:37:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 10:37:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-08-05 10:37:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 10:37:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-08-05 10:37:24,015 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-08-05 10:37:24,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:24,015 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-08-05 10:37:24,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:37:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-08-05 10:37:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:37:24,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:24,016 INFO L399 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2019-08-05 10:37:24,016 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:24,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:24,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2019-08-05 10:37:24,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:24,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:37:24,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:27,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:27,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:37:27,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:37:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:37:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:37:27,665 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 90 states. [2019-08-05 10:37:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:27,955 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-08-05 10:37:27,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:37:27,955 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 177 [2019-08-05 10:37:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:27,957 INFO L225 Difference]: With dead ends: 180 [2019-08-05 10:37:27,957 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 10:37:27,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:37:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 10:37:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-08-05 10:37:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:37:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-08-05 10:37:27,960 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-08-05 10:37:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:27,960 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-08-05 10:37:27,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:37:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-08-05 10:37:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 10:37:27,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:27,961 INFO L399 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2019-08-05 10:37:27,961 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:27,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:27,962 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2019-08-05 10:37:27,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:27,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:37:27,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:31,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:31,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:37:31,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:37:31,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:37:31,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:37:31,524 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 91 states. [2019-08-05 10:37:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:31,806 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2019-08-05 10:37:31,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:37:31,807 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 179 [2019-08-05 10:37:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:31,808 INFO L225 Difference]: With dead ends: 182 [2019-08-05 10:37:31,808 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 10:37:31,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:37:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 10:37:31,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-08-05 10:37:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 10:37:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-08-05 10:37:31,812 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2019-08-05 10:37:31,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:31,812 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-08-05 10:37:31,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:37:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-08-05 10:37:31,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 10:37:31,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:31,813 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2019-08-05 10:37:31,813 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:31,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:31,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2019-08-05 10:37:31,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:31,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:37:31,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:35,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:35,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:37:35,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:37:35,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:37:35,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:37:35,751 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 92 states. [2019-08-05 10:37:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:36,040 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2019-08-05 10:37:36,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:37:36,041 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 181 [2019-08-05 10:37:36,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:36,042 INFO L225 Difference]: With dead ends: 184 [2019-08-05 10:37:36,042 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 10:37:36,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:37:36,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 10:37:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-05 10:37:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:37:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-08-05 10:37:36,046 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2019-08-05 10:37:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:36,046 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-08-05 10:37:36,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:37:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-08-05 10:37:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 10:37:36,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:36,047 INFO L399 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2019-08-05 10:37:36,047 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:36,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:36,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2019-08-05 10:37:36,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:36,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:37:36,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:39,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:39,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:39,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:37:39,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:37:39,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:37:39,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:37:39,746 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 93 states. [2019-08-05 10:37:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:40,138 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-08-05 10:37:40,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:37:40,138 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 183 [2019-08-05 10:37:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:40,139 INFO L225 Difference]: With dead ends: 186 [2019-08-05 10:37:40,139 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:37:40,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:37:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:37:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-08-05 10:37:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 10:37:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-08-05 10:37:40,142 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2019-08-05 10:37:40,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:40,142 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-08-05 10:37:40,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:37:40,142 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-08-05 10:37:40,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 10:37:40,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:40,143 INFO L399 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2019-08-05 10:37:40,143 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:40,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:40,144 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2019-08-05 10:37:40,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:40,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:37:40,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:43,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:43,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:37:43,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:37:43,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:37:43,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:37:43,847 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 94 states. [2019-08-05 10:37:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:44,165 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2019-08-05 10:37:44,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:37:44,166 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 185 [2019-08-05 10:37:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:44,167 INFO L225 Difference]: With dead ends: 188 [2019-08-05 10:37:44,167 INFO L226 Difference]: Without dead ends: 188 [2019-08-05 10:37:44,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:37:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-05 10:37:44,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-08-05 10:37:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 10:37:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-08-05 10:37:44,171 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2019-08-05 10:37:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:44,171 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-08-05 10:37:44,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:37:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-08-05 10:37:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 10:37:44,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:44,172 INFO L399 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2019-08-05 10:37:44,173 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:44,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:44,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2019-08-05 10:37:44,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:44,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:37:44,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:48,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:48,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:37:48,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:37:48,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:37:48,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:37:48,144 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 95 states. [2019-08-05 10:37:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:48,454 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-08-05 10:37:48,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:37:48,454 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2019-08-05 10:37:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:48,456 INFO L225 Difference]: With dead ends: 190 [2019-08-05 10:37:48,456 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 10:37:48,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:37:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 10:37:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-08-05 10:37:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 10:37:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-08-05 10:37:48,459 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2019-08-05 10:37:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:48,459 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-08-05 10:37:48,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:37:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-08-05 10:37:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 10:37:48,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:48,461 INFO L399 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2019-08-05 10:37:48,461 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:48,461 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2019-08-05 10:37:48,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:48,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:37:48,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:52,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:52,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:37:52,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:37:52,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:37:52,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:37:52,545 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 96 states. [2019-08-05 10:37:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:52,846 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-08-05 10:37:52,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:37:52,846 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 189 [2019-08-05 10:37:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:52,847 INFO L225 Difference]: With dead ends: 192 [2019-08-05 10:37:52,847 INFO L226 Difference]: Without dead ends: 192 [2019-08-05 10:37:52,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:37:52,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-08-05 10:37:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-08-05 10:37:52,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 10:37:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-08-05 10:37:52,850 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2019-08-05 10:37:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:52,851 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-08-05 10:37:52,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:37:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-08-05 10:37:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 10:37:52,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:52,852 INFO L399 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2019-08-05 10:37:52,852 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:52,852 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2019-08-05 10:37:52,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:52,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:37:52,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:56,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:56,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:37:56,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:37:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:37:56,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:37:56,918 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 97 states. [2019-08-05 10:37:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:57,228 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2019-08-05 10:37:57,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:37:57,228 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 191 [2019-08-05 10:37:57,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:57,229 INFO L225 Difference]: With dead ends: 194 [2019-08-05 10:37:57,230 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 10:37:57,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:37:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 10:37:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-08-05 10:37:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 10:37:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-08-05 10:37:57,233 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2019-08-05 10:37:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:57,233 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-08-05 10:37:57,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:37:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-08-05 10:37:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 10:37:57,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:57,234 INFO L399 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2019-08-05 10:37:57,234 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:57,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2019-08-05 10:37:57,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:57,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:37:57,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:01,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:01,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:38:01,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:38:01,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:38:01,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:38:01,526 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 98 states. [2019-08-05 10:38:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:01,840 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-08-05 10:38:01,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:38:01,840 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 193 [2019-08-05 10:38:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:01,842 INFO L225 Difference]: With dead ends: 196 [2019-08-05 10:38:01,842 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 10:38:01,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:38:01,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 10:38:01,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-08-05 10:38:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:38:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 10:38:01,845 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2019-08-05 10:38:01,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:01,845 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 10:38:01,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:38:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 10:38:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:38:01,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:01,847 INFO L399 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2019-08-05 10:38:01,847 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:01,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:01,847 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2019-08-05 10:38:01,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:01,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:38:01,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:06,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:06,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:38:06,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:38:06,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:38:06,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:38:06,146 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 99 states. [2019-08-05 10:38:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:06,472 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-08-05 10:38:06,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:38:06,473 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 195 [2019-08-05 10:38:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:06,474 INFO L225 Difference]: With dead ends: 198 [2019-08-05 10:38:06,474 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 10:38:06,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:38:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 10:38:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-08-05 10:38:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 10:38:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-08-05 10:38:06,478 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2019-08-05 10:38:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:06,478 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2019-08-05 10:38:06,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:38:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2019-08-05 10:38:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 10:38:06,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:06,479 INFO L399 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2019-08-05 10:38:06,479 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:06,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:06,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251618, now seen corresponding path program 97 times [2019-08-05 10:38:06,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:06,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:38:06,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:10,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:10,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:38:10,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:38:10,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:38:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:38:10,563 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 100 states. [2019-08-05 10:38:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:11,005 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-08-05 10:38:11,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:38:11,005 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 197 [2019-08-05 10:38:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:11,006 INFO L225 Difference]: With dead ends: 200 [2019-08-05 10:38:11,006 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 10:38:11,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:38:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 10:38:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-08-05 10:38:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:38:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-08-05 10:38:11,009 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2019-08-05 10:38:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:11,009 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-08-05 10:38:11,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:38:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-08-05 10:38:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 10:38:11,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:11,010 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 1, 1] [2019-08-05 10:38:11,010 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:11,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1982715300, now seen corresponding path program 98 times [2019-08-05 10:38:11,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:11,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:38:11,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:15,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:15,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:38:15,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:38:15,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:38:15,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:38:15,188 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 101 states. [2019-08-05 10:38:15,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:15,520 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2019-08-05 10:38:15,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:38:15,521 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2019-08-05 10:38:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:15,522 INFO L225 Difference]: With dead ends: 202 [2019-08-05 10:38:15,522 INFO L226 Difference]: Without dead ends: 202 [2019-08-05 10:38:15,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:38:15,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-05 10:38:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-08-05 10:38:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 10:38:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-08-05 10:38:15,524 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2019-08-05 10:38:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:15,524 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-08-05 10:38:15,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:38:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-08-05 10:38:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 10:38:15,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:15,525 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 1, 1] [2019-08-05 10:38:15,525 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:15,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:15,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1576075034, now seen corresponding path program 99 times [2019-08-05 10:38:15,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:15,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:38:15,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:20,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:20,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:38:20,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:38:20,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:38:20,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:38:20,038 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 102 states. [2019-08-05 10:38:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:20,380 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-08-05 10:38:20,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:38:20,381 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2019-08-05 10:38:20,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:20,382 INFO L225 Difference]: With dead ends: 204 [2019-08-05 10:38:20,382 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 10:38:20,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:38:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 10:38:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2019-08-05 10:38:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 10:38:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2019-08-05 10:38:20,385 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2019-08-05 10:38:20,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:20,386 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2019-08-05 10:38:20,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:38:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2019-08-05 10:38:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 10:38:20,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:20,387 INFO L399 BasicCegarLoop]: trace histogram [101, 100, 1, 1] [2019-08-05 10:38:20,387 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1515348904, now seen corresponding path program 100 times [2019-08-05 10:38:20,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:20,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:38:20,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:25,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:25,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:38:25,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:38:25,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:38:25,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:38:25,099 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 103 states. [2019-08-05 10:38:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:25,450 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-08-05 10:38:25,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:38:25,451 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 203 [2019-08-05 10:38:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:25,452 INFO L225 Difference]: With dead ends: 206 [2019-08-05 10:38:25,452 INFO L226 Difference]: Without dead ends: 206 [2019-08-05 10:38:25,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:38:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-05 10:38:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-08-05 10:38:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 10:38:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-08-05 10:38:25,456 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2019-08-05 10:38:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:25,456 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-08-05 10:38:25,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:38:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-08-05 10:38:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-08-05 10:38:25,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:25,458 INFO L399 BasicCegarLoop]: trace histogram [102, 101, 1, 1] [2019-08-05 10:38:25,458 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash 256384490, now seen corresponding path program 101 times [2019-08-05 10:38:25,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:25,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:38:25,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:30,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:30,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:38:30,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:38:30,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:38:30,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:38:30,192 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 104 states. [2019-08-05 10:38:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:30,534 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2019-08-05 10:38:30,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:38:30,534 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 205 [2019-08-05 10:38:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:30,536 INFO L225 Difference]: With dead ends: 208 [2019-08-05 10:38:30,536 INFO L226 Difference]: Without dead ends: 208 [2019-08-05 10:38:30,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:38:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-08-05 10:38:30,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-08-05 10:38:30,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 10:38:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-08-05 10:38:30,539 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2019-08-05 10:38:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:30,539 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-08-05 10:38:30,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:38:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-08-05 10:38:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 10:38:30,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:30,541 INFO L399 BasicCegarLoop]: trace histogram [103, 102, 1, 1] [2019-08-05 10:38:30,541 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:30,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:30,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1572360108, now seen corresponding path program 102 times [2019-08-05 10:38:30,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:30,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:38:30,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:35,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:35,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:38:35,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:38:35,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:38:35,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:38:35,319 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 105 states. [2019-08-05 10:38:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:35,668 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-08-05 10:38:35,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:38:35,668 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 207 [2019-08-05 10:38:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:35,669 INFO L225 Difference]: With dead ends: 210 [2019-08-05 10:38:35,669 INFO L226 Difference]: Without dead ends: 210 [2019-08-05 10:38:35,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:38:35,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-08-05 10:38:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-08-05 10:38:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-08-05 10:38:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2019-08-05 10:38:35,671 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2019-08-05 10:38:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:35,672 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2019-08-05 10:38:35,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:38:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2019-08-05 10:38:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-08-05 10:38:35,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:35,673 INFO L399 BasicCegarLoop]: trace histogram [104, 103, 1, 1] [2019-08-05 10:38:35,673 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:35,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:35,673 INFO L82 PathProgramCache]: Analyzing trace with hash -790423314, now seen corresponding path program 103 times [2019-08-05 10:38:35,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:35,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:38:35,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:40,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:40,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:38:40,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:38:40,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:38:40,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:38:40,680 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 106 states. [2019-08-05 10:38:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:41,092 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2019-08-05 10:38:41,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:38:41,092 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 209 [2019-08-05 10:38:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:41,093 INFO L225 Difference]: With dead ends: 212 [2019-08-05 10:38:41,093 INFO L226 Difference]: Without dead ends: 212 [2019-08-05 10:38:41,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:38:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-05 10:38:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-08-05 10:38:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 10:38:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-08-05 10:38:41,096 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2019-08-05 10:38:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:41,097 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-08-05 10:38:41,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:38:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-08-05 10:38:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 10:38:41,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:41,098 INFO L399 BasicCegarLoop]: trace histogram [105, 104, 1, 1] [2019-08-05 10:38:41,098 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:41,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:41,099 INFO L82 PathProgramCache]: Analyzing trace with hash 612407728, now seen corresponding path program 104 times [2019-08-05 10:38:41,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:41,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:38:41,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:45,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:45,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:38:45,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:38:45,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:38:45,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:38:45,972 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 107 states. [2019-08-05 10:38:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:46,339 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2019-08-05 10:38:46,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:38:46,339 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 211 [2019-08-05 10:38:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:46,340 INFO L225 Difference]: With dead ends: 214 [2019-08-05 10:38:46,340 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 10:38:46,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:38:46,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 10:38:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-08-05 10:38:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-08-05 10:38:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-08-05 10:38:46,343 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 211 [2019-08-05 10:38:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:46,344 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-08-05 10:38:46,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:38:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-08-05 10:38:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 10:38:46,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:46,345 INFO L399 BasicCegarLoop]: trace histogram [106, 105, 1, 1] [2019-08-05 10:38:46,345 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:46,345 INFO L82 PathProgramCache]: Analyzing trace with hash 113308146, now seen corresponding path program 105 times [2019-08-05 10:38:46,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:46,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:38:46,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:51,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:51,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:38:51,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:38:51,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:38:51,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:38:51,380 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 108 states. [2019-08-05 10:38:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:51,806 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-08-05 10:38:51,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:38:51,806 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 213 [2019-08-05 10:38:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:51,807 INFO L225 Difference]: With dead ends: 216 [2019-08-05 10:38:51,807 INFO L226 Difference]: Without dead ends: 216 [2019-08-05 10:38:51,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:38:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-08-05 10:38:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-08-05 10:38:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-08-05 10:38:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-08-05 10:38:51,812 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 213 [2019-08-05 10:38:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:51,813 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-08-05 10:38:51,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:38:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-08-05 10:38:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-08-05 10:38:51,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:51,814 INFO L399 BasicCegarLoop]: trace histogram [107, 106, 1, 1] [2019-08-05 10:38:51,814 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:51,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1514946996, now seen corresponding path program 106 times [2019-08-05 10:38:51,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:51,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:38:51,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:56,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:56,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:38:56,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:38:56,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:38:56,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:38:56,775 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 109 states. [2019-08-05 10:38:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:57,233 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2019-08-05 10:38:57,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:38:57,234 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 215 [2019-08-05 10:38:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:57,235 INFO L225 Difference]: With dead ends: 218 [2019-08-05 10:38:57,235 INFO L226 Difference]: Without dead ends: 218 [2019-08-05 10:38:57,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:38:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-08-05 10:38:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-08-05 10:38:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-08-05 10:38:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2019-08-05 10:38:57,237 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 215 [2019-08-05 10:38:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:57,237 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2019-08-05 10:38:57,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:38:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2019-08-05 10:38:57,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 10:38:57,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:57,238 INFO L399 BasicCegarLoop]: trace histogram [108, 107, 1, 1] [2019-08-05 10:38:57,238 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:57,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:57,238 INFO L82 PathProgramCache]: Analyzing trace with hash -129849098, now seen corresponding path program 107 times [2019-08-05 10:38:57,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:57,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:38:57,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:02,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:02,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:39:02,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:39:02,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:39:02,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:39:02,395 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 110 states. [2019-08-05 10:39:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:02,783 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-08-05 10:39:02,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:39:02,794 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 217 [2019-08-05 10:39:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:02,794 INFO L225 Difference]: With dead ends: 220 [2019-08-05 10:39:02,794 INFO L226 Difference]: Without dead ends: 220 [2019-08-05 10:39:02,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:39:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-08-05 10:39:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-08-05 10:39:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:39:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-08-05 10:39:02,796 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 217 [2019-08-05 10:39:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:02,797 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-08-05 10:39:02,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:39:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-08-05 10:39:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-08-05 10:39:02,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:02,798 INFO L399 BasicCegarLoop]: trace histogram [109, 108, 1, 1] [2019-08-05 10:39:02,798 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:02,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:02,799 INFO L82 PathProgramCache]: Analyzing trace with hash -230930504, now seen corresponding path program 108 times [2019-08-05 10:39:02,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:02,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:39:02,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:39:05,343 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:39:05,343 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:39:05,347 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:39:05,347 INFO L202 PluginConnector]: Adding new model MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:39:05 BoogieIcfgContainer [2019-08-05 10:39:05,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:39:05,349 INFO L168 Benchmark]: Toolchain (without parser) took 243888.68 ms. Allocated memory was 134.7 MB in the beginning and 604.5 MB in the end (delta: 469.8 MB). Free memory was 112.3 MB in the beginning and 426.2 MB in the end (delta: -313.8 MB). Peak memory consumption was 155.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:05,350 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 113.4 MB in the beginning and 113.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:39:05,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.66 ms. Allocated memory is still 134.7 MB. Free memory was 112.1 MB in the beginning and 110.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:05,351 INFO L168 Benchmark]: Boogie Preprocessor took 20.91 ms. Allocated memory is still 134.7 MB. Free memory was 110.2 MB in the beginning and 109.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:05,352 INFO L168 Benchmark]: RCFGBuilder took 278.77 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 100.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:05,352 INFO L168 Benchmark]: TraceAbstraction took 243549.39 ms. Allocated memory was 134.7 MB in the beginning and 604.5 MB in the end (delta: 469.8 MB). Free memory was 99.8 MB in the beginning and 426.2 MB in the end (delta: -326.4 MB). Peak memory consumption was 143.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:05,355 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.22 ms. Allocated memory is still 134.7 MB. Free memory was 113.4 MB in the beginning and 113.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.66 ms. Allocated memory is still 134.7 MB. Free memory was 112.1 MB in the beginning and 110.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.91 ms. Allocated memory is still 134.7 MB. Free memory was 110.2 MB in the beginning and 109.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 278.77 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 100.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243549.39 ms. Allocated memory was 134.7 MB in the beginning and 604.5 MB in the end (delta: 469.8 MB). Free memory was 99.8 MB in the beginning and 426.2 MB in the end (delta: -326.4 MB). Peak memory consumption was 143.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 25). Cancelled while BasicCegarLoop was analyzing trace of length 220 with TraceHistMax 109,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 78 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 243.4s OverallTime, 109 OverallIterations, 109 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 217 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 12898 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11772 GetRequests, 5886 SyntacticMatches, 0 SemanticMatches, 5886 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 210.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=108, 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.3s AutomataMinimizationTime, 108 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 215.4s InterpolantComputationTime, 11880 NumberOfCodeBlocks, 11880 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 11772 ConstructedInterpolants, 0 QuantifiedInterpolants, 11921112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 23976 ConjunctsInSsa, 6102 ConjunctsInUnsatCore, 108 InterpolantComputations, 1 PerfectInterpolantSequences, 0/419868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown