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/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:39:01,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:39:01,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:39:01,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:39:01,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:39:01,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:39:01,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:39:01,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:39:01,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:39:01,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:39:01,345 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:39:01,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:39:01,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:39:01,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:39:01,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:39:01,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:39:01,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:39:01,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:39:01,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:39:01,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:39:01,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:39:01,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:39:01,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:39:01,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:39:01,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:39:01,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:39:01,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:39:01,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:39:01,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:39:01,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:39:01,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:39:01,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:39:01,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:39:01,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:39:01,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:39:01,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:39:01,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:39:01,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:39:01,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:39:01,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:39:01,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:39:01,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:39:01,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:39:01,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:39:01,418 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:39:01,419 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:39:01,420 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl [2019-08-05 10:39:01,420 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl' [2019-08-05 10:39:01,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:39:01,453 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:39:01,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:39:01,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:39:01,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:39:01,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:01" (1/1) ... [2019-08-05 10:39:01,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:01" (1/1) ... [2019-08-05 10:39:01,490 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:39:01,490 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:39:01,491 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:39:01,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:39:01,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:39:01,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:39:01,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:39:01,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:01" (1/1) ... [2019-08-05 10:39:01,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:01" (1/1) ... [2019-08-05 10:39:01,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:01" (1/1) ... [2019-08-05 10:39:01,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:01" (1/1) ... [2019-08-05 10:39:01,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:01" (1/1) ... [2019-08-05 10:39:01,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:01" (1/1) ... [2019-08-05 10:39:01,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:01" (1/1) ... [2019-08-05 10:39:01,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:39:01,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:39:01,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:39:01,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:39:01,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39: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:39:01,599 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:39:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:39:01,600 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:39:01,826 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:39:01,827 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:39:01,828 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:39:01 BoogieIcfgContainer [2019-08-05 10:39:01,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:39:01,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:39:01,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:39:01,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:39:01,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:01" (1/2) ... [2019-08-05 10:39:01,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7348435c and model type DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:39:01, skipping insertion in model container [2019-08-05 10:39:01,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:39:01" (2/2) ... [2019-08-05 10:39:01,840 INFO L109 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl [2019-08-05 10:39:01,850 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:39:01,861 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:39:01,879 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:39:01,904 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:39:01,905 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:39:01,906 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:39:01,906 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:39:01,906 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:39:01,906 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:39:01,906 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:39:01,906 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:39:01,907 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:39:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-08-05 10:39:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:39:01,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:01,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:39:01,932 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:01,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:01,938 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-08-05 10:39:01,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:02,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:39:02,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:02,079 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:39:02,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:39:02,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:39:02,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:39:02,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:39:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:39:02,101 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-08-05 10:39:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:02,175 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:39:02,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:39:02,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:39:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:02,205 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:39:02,206 INFO L226 Difference]: Without dead ends: 4 [2019-08-05 10:39:02,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:39:02,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-08-05 10:39:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-08-05 10:39:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-08-05 10:39:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-08-05 10:39:02,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-08-05 10:39:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:02,272 INFO L475 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-08-05 10:39:02,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:39:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-08-05 10:39:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:39:02,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:02,274 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:39:02,274 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:02,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:02,275 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-08-05 10:39:02,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:02,297 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:39:02,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:02,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:02,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:39:02,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:39:02,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:39:02,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:39:02,389 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-08-05 10:39:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:02,459 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:39:02,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:39:02,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:39:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:02,460 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:39:02,460 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:39:02,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:39:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:39:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:39:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:39:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:39:02,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:39:02,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:02,463 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:39:02,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:39:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:39:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:39:02,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:02,464 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-08-05 10:39:02,465 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:02,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:02,465 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2019-08-05 10:39:02,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:02,478 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:39:02,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:02,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:02,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:39:02,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:39:02,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:39:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:39:02,606 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 10:39:02,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:02,693 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:39:02,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:39:02,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:39:02,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:02,695 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:39:02,695 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:39:02,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:39:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:39:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:39:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:39:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:39:02,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:39:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:02,699 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:39:02,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:39:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:39:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:39:02,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:02,700 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-08-05 10:39:02,700 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2019-08-05 10:39:02,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:02,715 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:39:02,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:02,921 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:39:02,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:02,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:39:02,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:39:02,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:39:02,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:39:02,925 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 10:39:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:02,984 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:39:02,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:39:02,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:39:02,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:02,985 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:39:02,986 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:39:02,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:39:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:39:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:39:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:39:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:39:02,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:39:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:02,988 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:39:02,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:39:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:39:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:39:02,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:02,989 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-08-05 10:39:02,990 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:02,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:02,990 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2019-08-05 10:39:02,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:03,006 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:39:03,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:03,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:03,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:39:03,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:39:03,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:39:03,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:39:03,230 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:39:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:03,289 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:39:03,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:39:03,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:39:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:03,291 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:39:03,291 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:39:03,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:39:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:39:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:39:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:39:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:39:03,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:39:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:03,294 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:39:03,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:39:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:39:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:39:03,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:03,295 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-08-05 10:39:03,295 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:03,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:03,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2019-08-05 10:39:03,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:03,312 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:39:03,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:03,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:03,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:39:03,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:39:03,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:39:03,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:39:03,550 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 10:39:03,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:03,620 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:39:03,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:39:03,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:39:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:03,622 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:39:03,622 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:39:03,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:39:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:39:03,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:39:03,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:39:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:39:03,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:39:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:03,626 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:39:03,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:39:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:39:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:39:03,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:03,627 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1] [2019-08-05 10:39:03,627 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:03,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2019-08-05 10:39:03,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:03,648 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:39:03,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:04,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:04,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:39:04,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:39:04,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:39:04,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:39:04,058 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 10:39:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:04,176 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:39:04,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:39:04,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:39:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:04,179 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:39:04,179 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:39:04,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:39:04,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:39:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:39:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:39:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:39:04,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:39:04,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:04,183 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:39:04,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:39:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:39:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:39:04,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:04,184 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1] [2019-08-05 10:39:04,184 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:04,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2019-08-05 10:39:04,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:04,201 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:39:04,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:04,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:04,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:39:04,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:39:04,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:39:04,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:39:04,389 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 10:39:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:04,482 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:39:04,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:39:04,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:39:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:04,484 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:39:04,484 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:39:04,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:39:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:39:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:39:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:39:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:39:04,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:39:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:04,488 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:39:04,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:39:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:39:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:39:04,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:04,489 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1] [2019-08-05 10:39:04,489 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:04,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:04,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2019-08-05 10:39:04,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:04,509 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:39:04,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:04,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:04,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:39:04,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:39:04,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:39:04,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:39:04,754 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 10:39:04,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:04,927 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:39:04,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:39:04,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:39:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:04,929 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:39:04,929 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:39:04,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:39:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:39:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:39:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:39:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:39:04,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:39:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:04,933 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:39:04,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:39:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:39:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:39:04,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:04,934 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1] [2019-08-05 10:39:04,934 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:04,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2019-08-05 10:39:04,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:04,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:39:04,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:05,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:05,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:39:05,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:39:05,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:39:05,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:39:05,189 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 10:39:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:05,306 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:39:05,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:39:05,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:39:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:05,307 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:39:05,307 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:39:05,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:39:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:39:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:39:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:39:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:39:05,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:39:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:05,311 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:39:05,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:39:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:39:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:39:05,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:05,312 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1] [2019-08-05 10:39:05,312 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2019-08-05 10:39:05,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:05,331 WARN L254 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:39:05,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:05,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:05,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:39:05,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:39:05,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:39:05,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:39:05,665 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 10:39:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:05,794 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:39:05,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:39:05,794 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:39:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:05,795 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:39:05,796 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:39:05,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:39:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:39:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:39:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:39:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:39:05,799 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:39:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:05,799 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:39:05,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:39:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:39:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:39:05,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:05,800 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1] [2019-08-05 10:39:05,800 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:05,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2019-08-05 10:39:05,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:05,820 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:39:05,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:06,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:06,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:39:06,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:39:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:39:06,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:39:06,051 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 10:39:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:06,237 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:39:06,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:39:06,238 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:39:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:06,239 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:39:06,239 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:39:06,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:39:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:39:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:39:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:39:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:39:06,242 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:39:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:06,243 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:39:06,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:39:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:39:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:39:06,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:06,244 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1] [2019-08-05 10:39:06,244 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:06,245 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2019-08-05 10:39:06,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:06,267 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:39:06,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:06,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:06,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:39:06,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:39:06,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:39:06,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:39:06,569 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 10:39:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:06,753 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:39:06,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:39:06,753 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:39:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:06,754 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:39:06,754 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:39:06,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:39:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:39:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:39:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:39:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:39:06,758 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:39:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:06,758 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:39:06,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:39:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:39:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:39:06,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:06,759 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1] [2019-08-05 10:39:06,759 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:06,760 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2019-08-05 10:39:06,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:06,791 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:39:06,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:07,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:07,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:39:07,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:39:07,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:39:07,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:39:07,249 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 10:39:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:07,529 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:39:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:39:07,530 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:39:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:07,531 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:39:07,531 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:39:07,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:39:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:39:07,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:39:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:39:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:39:07,535 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:39:07,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:07,535 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:39:07,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:39:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:39:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:39:07,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:07,536 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1] [2019-08-05 10:39:07,536 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:07,537 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2019-08-05 10:39:07,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:07,554 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:39:07,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:07,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:07,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:39:07,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:39:07,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:39:07,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:39:07,801 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 10:39:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:08,113 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:39:08,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:39:08,114 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:39:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:08,114 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:39:08,115 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:39:08,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:39:08,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:39:08,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:39:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:39:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:39:08,119 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:39:08,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:08,119 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:39:08,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:39:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:39:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:39:08,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:08,121 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1] [2019-08-05 10:39:08,121 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2019-08-05 10:39:08,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:08,149 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:39:08,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:08,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:08,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:39:08,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:39:08,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:39:08,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:39:08,588 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 10:39:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:08,825 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:39:08,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:39:08,826 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:39:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:08,827 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:39:08,827 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:39:08,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:39:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:39:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:39:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:39:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:39:08,831 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:39:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:08,831 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:39:08,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:39:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:39:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:39:08,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:08,832 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1] [2019-08-05 10:39:08,832 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:08,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:08,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2019-08-05 10:39:08,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:08,848 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:39:08,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:09,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:09,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:39:09,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:39:09,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:39:09,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:39:09,169 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 10:39:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:09,444 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:39:09,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:39:09,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:39:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:09,446 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:39:09,446 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:39:09,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:39:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:39:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:39:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:39:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:39:09,450 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:39:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:09,451 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:39:09,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:39:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:39:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:39:09,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:09,451 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1] [2019-08-05 10:39:09,452 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:09,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2019-08-05 10:39:09,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:09,467 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:39:09,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:10,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:10,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:39:10,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:39:10,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:39:10,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:39:10,065 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 10:39:10,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:10,405 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:39:10,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:39:10,405 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:39:10,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:10,406 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:39:10,406 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:39:10,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:39:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:39:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:39:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:39:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:39:10,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:39:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:10,410 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:39:10,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:39:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:39:10,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:39:10,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:10,411 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1] [2019-08-05 10:39:10,411 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:10,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:10,411 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2019-08-05 10:39:10,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:10,426 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:39:10,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:10,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:10,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:39:10,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:39:10,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:39:10,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:39:10,845 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 10:39:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:11,190 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:39:11,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:39:11,190 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:39:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:11,191 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:39:11,192 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:39:11,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:39:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:39:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:39:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:39:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:39:11,196 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:39:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:11,196 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:39:11,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:39:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:39:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:39:11,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:11,197 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1] [2019-08-05 10:39:11,198 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2019-08-05 10:39:11,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:11,215 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:39:11,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:11,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:11,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:39:11,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:39:11,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:39:11,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:39:11,604 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 10:39:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:12,097 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:39:12,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:39:12,098 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:39:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:12,099 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:39:12,099 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:39:12,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:39:12,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:39:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:39:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:39:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:39:12,103 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:39:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:12,104 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:39:12,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:39:12,104 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:39:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:39:12,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:12,105 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1] [2019-08-05 10:39:12,105 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:12,105 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2019-08-05 10:39:12,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:12,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:39:12,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:12,606 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:39:12,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:12,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:39:12,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:39:12,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:39:12,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:39:12,608 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-05 10:39:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:13,002 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:39:13,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:39:13,002 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:39:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:13,003 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:39:13,004 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:39:13,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:39:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:39:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:39:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:39:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:39:13,007 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:39:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:13,007 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:39:13,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:39:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:39:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:39:13,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:13,008 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1] [2019-08-05 10:39:13,009 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:13,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:13,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2019-08-05 10:39:13,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:13,022 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:39:13,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:13,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:13,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:39:13,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:39:13,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:39:13,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:39:13,386 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-05 10:39:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:13,891 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:39:13,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:39:13,894 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:39:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:13,894 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:39:13,894 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:39:13,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:39:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:39:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:39:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:39:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:39:13,897 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:39:13,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:13,897 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:39:13,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:39:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:39:13,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:39:13,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:13,898 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1] [2019-08-05 10:39:13,899 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:13,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:13,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2019-08-05 10:39:13,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:13,912 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:39:13,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:14,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:14,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:39:14,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:39:14,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:39:14,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:39:14,462 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-05 10:39:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:14,966 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:39:14,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:39:14,967 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:39:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:14,967 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:39:14,967 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:39:14,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:39:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:39:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:39:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:39:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:39:14,972 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:39:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:14,972 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:39:14,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:39:14,973 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:39:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:39:14,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:14,973 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1] [2019-08-05 10:39:14,974 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:14,974 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2019-08-05 10:39:14,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:14,988 WARN L254 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:39:14,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:15,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:15,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:39:15,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:39:15,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:39:15,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:39:15,468 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-05 10:39:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:16,398 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:39:16,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:39:16,399 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:39:16,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:16,400 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:39:16,400 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:39:16,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:39:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:39:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:39:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:39:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:39:16,404 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:39:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:16,404 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:39:16,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:39:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:39:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:39:16,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:16,405 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1] [2019-08-05 10:39:16,405 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:16,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:16,406 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2019-08-05 10:39:16,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:16,419 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:39:16,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:16,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:16,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:39:16,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:39:16,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:39:16,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:39:16,880 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-05 10:39:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:17,617 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:39:17,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:39:17,618 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:39:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:17,618 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:39:17,618 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:39:17,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:39:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:39:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:39:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:39:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:39:17,623 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:39:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:17,624 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:39:17,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:39:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:39:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:39:17,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:17,625 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1] [2019-08-05 10:39:17,625 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:17,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2019-08-05 10:39:17,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:17,639 WARN L254 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:39:17,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:18,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:18,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:39:18,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:39:18,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:39:18,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:39:18,347 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-05 10:39:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:18,923 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:39:18,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:39:18,923 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 10:39:18,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:18,924 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:39:18,924 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:39:18,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:39:18,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:39:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:39:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:39:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:39:18,928 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:39:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:18,928 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:39:18,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:39:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:39:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:39:18,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:18,929 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1] [2019-08-05 10:39:18,929 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2019-08-05 10:39:18,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:18,944 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:39:18,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:19,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:19,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:39:19,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:39:19,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:39:19,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:39:19,491 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-05 10:39:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:20,136 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:39:20,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:39:20,136 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 10:39:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:20,137 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:39:20,137 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:39:20,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:39:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:39:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:39:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:39:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:39:20,141 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:39:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:20,142 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:39:20,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:39:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:39:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:39:20,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:20,143 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1] [2019-08-05 10:39:20,143 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:20,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:20,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2019-08-05 10:39:20,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:20,158 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:39:20,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:20,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:20,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:39:20,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:39:20,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:39:20,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:39:20,731 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-05 10:39:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:21,398 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:39:21,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:39:21,399 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 10:39:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:21,400 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:39:21,400 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:39:21,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:39:21,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:39:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:39:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:39:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:39:21,404 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:39:21,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:21,404 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:39:21,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:39:21,404 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:39:21,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:39:21,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:21,405 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1] [2019-08-05 10:39:21,405 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:21,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:21,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2019-08-05 10:39:21,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:21,419 WARN L254 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:39:21,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:22,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:22,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:39:22,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:39:22,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:39:22,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:39:22,012 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-05 10:39:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:22,843 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:39:22,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:39:22,844 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:39:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:22,845 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:39:22,845 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:39:22,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:39:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:39:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:39:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:39:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:39:22,849 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:39:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:22,850 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:39:22,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:39:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:39:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:39:22,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:22,851 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1] [2019-08-05 10:39:22,851 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:22,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:22,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2019-08-05 10:39:22,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:22,866 WARN L254 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 10:39:22,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:24,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:24,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:39:24,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:39:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:39:24,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:39:24,986 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-05 10:39:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:25,743 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:39:25,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:39:25,743 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 10:39:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:25,744 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:39:25,744 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:39:25,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:39:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:39:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:39:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:39:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:39:25,748 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:39:25,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:25,749 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:39:25,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:39:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:39:25,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:39:25,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:25,749 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1] [2019-08-05 10:39:25,750 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:25,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:25,750 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2019-08-05 10:39:25,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:25,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:39:25,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:27,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:27,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:39:27,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:39:27,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:39:27,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:39:27,459 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-05 10:39:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:28,339 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:39:28,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:39:28,339 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 10:39:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:28,340 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:39:28,340 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:39:28,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:39:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:39:28,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:39:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:39:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:39:28,344 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:39:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:28,344 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:39:28,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:39:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:39:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:39:28,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:28,345 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1] [2019-08-05 10:39:28,345 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:28,345 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2019-08-05 10:39:28,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:28,361 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:39:28,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:29,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:29,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:39:29,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:39:29,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:39:29,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:39:29,072 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-05 10:39:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:29,937 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:39:29,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:39:29,937 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 10:39:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:29,938 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:39:29,938 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:39:29,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:39:29,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:39:29,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:39:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:39:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:39:29,943 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:39:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:29,943 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:39:29,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:39:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:39:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:39:29,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:29,944 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1] [2019-08-05 10:39:29,944 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:29,944 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2019-08-05 10:39:29,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:29,959 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 10:39:29,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:30,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:30,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:39:30,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:39:30,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:39:30,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:39:30,953 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-05 10:39:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:31,862 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:39:31,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:39:31,862 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 10:39:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:31,863 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:39:31,863 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:39:31,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:39:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:39:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:39:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:39:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:39:31,867 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:39:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:31,867 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:39:31,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:39:31,867 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:39:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:39:31,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:31,868 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1] [2019-08-05 10:39:31,868 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:31,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:31,869 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2019-08-05 10:39:31,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:31,883 WARN L254 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:39:31,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:32,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:32,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:39:32,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:39:32,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:39:32,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:39:32,840 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-05 10:39:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:33,818 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:39:33,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:39:33,818 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 10:39:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:33,819 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:39:33,819 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:39:33,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:39:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:39:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:39:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:39:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:39:33,822 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:39:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:33,822 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:39:33,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:39:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:39:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:39:33,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:33,823 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1] [2019-08-05 10:39:33,823 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:33,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2019-08-05 10:39:33,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:33,838 WARN L254 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:39:33,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:34,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:34,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:39:34,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:39:34,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:39:34,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:39:34,854 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-05 10:39:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:35,877 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:39:35,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:39:35,878 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 10:39:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:35,879 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:39:35,879 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:39:35,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:39:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:39:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:39:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:39:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:39:35,882 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:39:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:35,883 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:39:35,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:39:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:39:35,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:39:35,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:35,883 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1] [2019-08-05 10:39:35,883 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:35,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:35,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2019-08-05 10:39:35,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:35,901 WARN L254 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 10:39:35,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:36,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:36,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:39:36,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:39:36,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:39:36,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:39:36,792 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-05 10:39:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:37,990 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:39:37,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:39:37,990 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 10:39:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:37,991 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:39:37,991 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:39:37,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:39:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:39:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:39:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:39:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:39:37,995 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:39:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:37,995 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:39:37,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:39:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:39:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:39:37,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:37,996 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1] [2019-08-05 10:39:37,996 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:37,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2019-08-05 10:39:37,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:38,015 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 10:39:38,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:38,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:38,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:39:38,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:39:38,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:39:38,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:39:38,868 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-05 10:39:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:40,051 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:39:40,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:39:40,052 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:39:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:40,053 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:39:40,053 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:39:40,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:39:40,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:39:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:39:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:39:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:39:40,057 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:39:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:40,057 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:39:40,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:39:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:39:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:39:40,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:40,058 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1] [2019-08-05 10:39:40,058 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:40,058 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2019-08-05 10:39:40,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:40,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:39:40,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:41,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:41,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:39:41,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:39:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:39:41,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:39:41,080 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-05 10:39:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:42,441 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:39:42,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:39:42,442 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 10:39:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:42,442 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:39:42,443 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:39:42,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:39:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:39:42,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:39:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:39:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:39:42,447 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:39:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:42,447 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:39:42,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:39:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:39:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:39:42,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:42,448 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1] [2019-08-05 10:39:42,448 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:42,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:42,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2019-08-05 10:39:42,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:42,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 10:39:42,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:43,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:43,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:39:43,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:39:43,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:39:43,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:39:43,620 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-05 10:39:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:44,891 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:39:44,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:39:44,891 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 10:39:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:44,892 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:39:44,892 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:39:44,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:39:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:39:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:39:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:39:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:39:44,895 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:39:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:44,895 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:39:44,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:39:44,896 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:39:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:39:44,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:44,896 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1] [2019-08-05 10:39:44,897 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:44,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:44,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2019-08-05 10:39:44,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:44,916 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 10:39:44,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:45,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:45,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:39:45,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:39:45,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:39:45,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:39:45,946 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-05 10:39:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:47,361 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:39:47,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:39:47,362 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 10:39:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:47,363 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:39:47,363 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:39:47,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:39:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:39:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:39:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:39:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:39:47,366 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:39:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:47,367 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:39:47,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:39:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:39:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:39:47,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:47,367 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1] [2019-08-05 10:39:47,368 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:47,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2019-08-05 10:39:47,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:47,387 WARN L254 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:39:47,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:48,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:48,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:39:48,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:39:48,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:39:48,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:39:48,628 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-05 10:39:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:50,044 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:39:50,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:39:50,045 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 10:39:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:50,045 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:39:50,046 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:39:50,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:39:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:39:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:39:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:39:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:39:50,048 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:39:50,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:50,049 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:39:50,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:39:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:39:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:39:50,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:50,049 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1] [2019-08-05 10:39:50,050 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:50,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:50,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2019-08-05 10:39:50,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:50,068 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 10:39:50,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:51,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:51,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:39:51,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:39:51,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:39:51,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:39:51,076 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-05 10:39:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:52,533 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:39:52,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:39:52,534 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 10:39:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:52,534 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:39:52,535 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:39:52,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:39:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:39:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:39:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:39:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:39:52,538 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:39:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:52,538 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:39:52,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:39:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:39:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:39:52,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:52,539 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1] [2019-08-05 10:39:52,539 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2019-08-05 10:39:52,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:52,558 WARN L254 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 10:39:52,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:53,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:53,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:39:53,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:39:53,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:39:53,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:39:53,997 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-05 10:39:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:55,551 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:39:55,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:39:55,552 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 10:39:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:55,552 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:39:55,553 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:39:55,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:39:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:39:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:39:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:39:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:39:55,557 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:39:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:55,557 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:39:55,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:39:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:39:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:39:55,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:55,558 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1] [2019-08-05 10:39:55,559 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:55,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:55,559 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2019-08-05 10:39:55,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:55,579 WARN L254 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 10:39:55,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:56,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:56,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:39:56,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:39:56,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:39:56,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:39:56,658 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-05 10:39:58,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:58,318 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:39:58,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:39:58,319 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 10:39:58,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:58,320 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:39:58,320 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:39:58,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:39:58,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:39:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:39:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:39:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:39:58,323 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:39:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:58,323 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:39:58,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:39:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:39:58,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:39:58,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:58,324 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1] [2019-08-05 10:39:58,325 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:58,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:58,325 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2019-08-05 10:39:58,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:58,344 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 181 conjunts are in the unsatisfiable core [2019-08-05 10:39:58,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:59,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:59,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:39:59,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:39:59,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:39:59,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:39:59,522 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-05 10:40:01,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:01,173 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:40:01,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:40:01,174 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 10:40:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:01,174 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:40:01,175 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:40:01,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:40:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:40:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:40:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:40:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:40:01,177 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:40:01,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:01,178 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:40:01,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:40:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:40:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:40:01,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:01,178 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1] [2019-08-05 10:40:01,179 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2019-08-05 10:40:01,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:01,197 WARN L254 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-05 10:40:01,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:02,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:02,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:40:02,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:40:02,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:40:02,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:40:02,560 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-05 10:40:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:04,396 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:40:04,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:40:04,396 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 10:40:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:04,397 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:40:04,397 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:40:04,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:40:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:40:04,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:40:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:40:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:40:04,399 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:40:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:04,400 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:40:04,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:40:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:40:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:40:04,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:04,401 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1] [2019-08-05 10:40:04,401 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:04,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:04,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2019-08-05 10:40:04,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:04,424 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 10:40:04,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:05,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:05,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:40:05,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:40:05,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:40:05,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:40:05,681 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-05 10:40:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:07,486 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:40:07,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:40:07,487 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 10:40:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:07,488 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:40:07,488 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:40:07,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:40:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:40:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:40:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:40:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:40:07,490 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:40:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:07,491 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:40:07,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:40:07,491 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:40:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:40:07,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:07,492 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1] [2019-08-05 10:40:07,492 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:07,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:07,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2019-08-05 10:40:07,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:07,514 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 193 conjunts are in the unsatisfiable core [2019-08-05 10:40:07,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:09,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:09,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:40:09,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:40:09,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:40:09,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:40:09,059 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-05 10:40:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:10,952 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:40:10,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:40:10,952 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 10:40:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:10,953 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:40:10,953 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:40:10,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:40:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:40:10,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:40:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:40:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:40:10,957 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:40:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:10,957 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:40:10,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:40:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:40:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:40:10,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:10,958 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1] [2019-08-05 10:40:10,958 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:10,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2019-08-05 10:40:10,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:10,978 WARN L254 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 10:40:10,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:12,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:12,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:40:12,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:40:12,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:40:12,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:40:12,350 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-05 10:40:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:14,412 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:40:14,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:40:14,413 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 10:40:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:14,414 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:40:14,414 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:40:14,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:40:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:40:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:40:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:40:14,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:40:14,416 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:40:14,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:14,416 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:40:14,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:40:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:40:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:40:14,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:14,417 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1] [2019-08-05 10:40:14,418 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:14,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2019-08-05 10:40:14,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:14,442 WARN L254 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 10:40:14,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:15,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:15,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:40:15,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:40:15,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:40:15,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:40:15,801 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-05 10:40:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:17,826 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:40:17,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:40:17,827 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 10:40:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:17,828 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:40:17,828 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:40:17,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:40:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:40:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:40:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:40:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:40:17,831 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:40:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:17,831 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:40:17,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:40:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:40:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:40:17,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:17,835 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1] [2019-08-05 10:40:17,835 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:17,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:17,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2019-08-05 10:40:17,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:17,862 WARN L254 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 205 conjunts are in the unsatisfiable core [2019-08-05 10:40:17,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:20,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:20,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:40:20,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:40:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:40:20,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:40:20,191 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-05 10:40:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:22,308 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:40:22,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:40:22,308 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 10:40:22,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:22,309 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:40:22,310 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:40:22,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:40:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:40:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:40:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:40:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:40:22,312 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:40:22,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:22,312 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:40:22,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:40:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:40:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:40:22,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:22,313 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1] [2019-08-05 10:40:22,313 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:22,313 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2019-08-05 10:40:22,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:22,339 WARN L254 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 10:40:22,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:24,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:24,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:40:24,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:40:24,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:40:24,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:40:24,160 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-05 10:40:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:26,382 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:40:26,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:40:26,382 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 10:40:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:26,383 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:40:26,383 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:40:26,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:40:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:40:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:40:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:40:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:40:26,386 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:40:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:26,386 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:40:26,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:40:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:40:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:40:26,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:26,387 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1] [2019-08-05 10:40:26,387 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:26,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:26,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2019-08-05 10:40:26,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:26,413 WARN L254 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 10:40:26,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:27,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:27,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:40:27,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:40:27,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:40:27,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:40:27,953 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-05 10:40:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:30,300 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:40:30,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:40:30,301 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 10:40:30,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:30,301 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:40:30,302 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:40:30,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:40:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:40:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:40:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:40:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:40:30,305 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:40:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:30,305 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:40:30,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:40:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:40:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:40:30,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:30,306 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1] [2019-08-05 10:40:30,306 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:30,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:30,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2019-08-05 10:40:30,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:30,333 WARN L254 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 217 conjunts are in the unsatisfiable core [2019-08-05 10:40:30,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:31,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:31,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:31,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:40:31,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:40:31,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:40:31,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:40:31,970 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-05 10:40:34,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:34,491 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:40:34,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:40:34,491 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 10:40:34,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:34,492 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:40:34,492 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:40:34,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:40:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:40:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:40:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:40:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:40:34,495 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:40:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:34,495 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:40:34,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:40:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:40:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:40:34,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:34,496 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1] [2019-08-05 10:40:34,496 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:34,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:34,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2019-08-05 10:40:34,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:34,524 WARN L254 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-05 10:40:34,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:36,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:36,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:40:36,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:40:36,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:40:36,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:40:36,246 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-05 10:40:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:38,691 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:40:38,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:40:38,692 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 10:40:38,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:38,693 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:40:38,693 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:40:38,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:40:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:40:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:40:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:40:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:40:38,695 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:40:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:38,696 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:40:38,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:40:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:40:38,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:40:38,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:38,696 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1] [2019-08-05 10:40:38,700 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:38,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2019-08-05 10:40:38,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:38,730 WARN L254 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 10:40:38,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:40,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:40,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:40:40,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:40:40,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:40:40,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:40:40,632 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-05 10:40:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:43,178 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:40:43,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:40:43,179 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 10:40:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:43,180 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:40:43,180 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:40:43,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:40:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:40:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:40:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:40:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:40:43,182 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:40:43,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:43,183 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:40:43,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:40:43,183 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:40:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:40:43,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:43,183 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1] [2019-08-05 10:40:43,183 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:43,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:43,184 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2019-08-05 10:40:43,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:43,220 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 229 conjunts are in the unsatisfiable core [2019-08-05 10:40:43,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:45,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:45,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:40:45,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:40:45,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:40:45,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:40:45,269 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-08-05 10:40:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:47,912 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:40:47,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:40:47,913 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 10:40:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:47,914 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:40:47,914 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:40:47,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:40:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:40:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:40:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:40:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:40:47,917 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:40:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:47,918 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:40:47,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:40:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:40:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:40:47,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:47,918 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1] [2019-08-05 10:40:47,919 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2019-08-05 10:40:47,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:47,943 WARN L254 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-05 10:40:47,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:49,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:49,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:40:49,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:40:49,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:40:49,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:40:49,859 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2019-08-05 10:40:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:52,575 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:40:52,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:40:52,576 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-08-05 10:40:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:52,576 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:40:52,577 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:40:52,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:40:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:40:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:40:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:40:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:40:52,580 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:40:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:52,580 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:40:52,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:40:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:40:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:40:52,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:52,581 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1] [2019-08-05 10:40:52,581 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:52,582 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2019-08-05 10:40:52,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:52,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 10:40:52,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:55,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:55,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:40:55,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:40:55,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:40:55,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:40:55,093 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2019-08-05 10:40:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:57,899 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:40:57,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:40:57,899 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2019-08-05 10:40:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:57,900 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:40:57,900 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:40:57,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:40:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:40:57,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:40:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:40:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:40:57,903 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:40:57,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:57,904 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:40:57,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:40:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:40:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:40:57,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:57,904 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1] [2019-08-05 10:40:57,904 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:57,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:57,905 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2019-08-05 10:40:57,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:57,936 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 241 conjunts are in the unsatisfiable core [2019-08-05 10:40:57,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:00,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:00,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:41:00,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:41:00,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:41:00,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:41:00,215 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2019-08-05 10:41:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:03,127 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:41:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:41:03,127 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2019-08-05 10:41:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:03,128 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:41:03,128 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:41:03,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:41:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:41:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:41:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:41:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:41:03,131 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:41:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:03,131 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:41:03,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:41:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:41:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:41:03,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:03,131 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1] [2019-08-05 10:41:03,132 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:03,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:03,132 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2019-08-05 10:41:03,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:03,165 WARN L254 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-05 10:41:03,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:05,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:05,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:41:05,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:41:05,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:41:05,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:41:05,356 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2019-08-05 10:41:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:08,365 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:41:08,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:41:08,366 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2019-08-05 10:41:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:08,367 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:41:08,367 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:41:08,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:41:08,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:41:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:41:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:41:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:41:08,369 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:41:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:08,369 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:41:08,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:41:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:41:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:41:08,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:08,370 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1] [2019-08-05 10:41:08,370 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:08,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:08,370 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2019-08-05 10:41:08,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:08,394 WARN L254 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 10:41:08,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:10,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:10,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:41:10,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:41:10,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:41:10,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:41:10,613 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2019-08-05 10:41:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:13,729 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:41:13,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:41:13,730 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2019-08-05 10:41:13,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:13,731 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:41:13,731 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:41:13,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:41:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:41:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:41:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:41:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:41:13,733 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:41:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:13,733 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:41:13,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:41:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:41:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:41:13,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:13,734 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1] [2019-08-05 10:41:13,735 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2019-08-05 10:41:13,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:13,760 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 253 conjunts are in the unsatisfiable core [2019-08-05 10:41:13,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:16,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:16,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:41:16,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:41:16,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:41:16,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:41:16,033 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2019-08-05 10:41:19,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:19,253 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:41:19,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:41:19,254 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2019-08-05 10:41:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:19,254 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:41:19,255 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:41:19,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:41:19,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:41:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:41:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:41:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:41:19,258 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:41:19,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:19,258 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:41:19,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:41:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:41:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:41:19,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:19,259 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1] [2019-08-05 10:41:19,259 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:19,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2019-08-05 10:41:19,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:19,295 WARN L254 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-05 10:41:19,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:21,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:21,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:41:21,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:41:21,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:41:21,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:41:21,669 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2019-08-05 10:41:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:24,997 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:41:24,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:41:24,998 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2019-08-05 10:41:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:24,999 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:41:24,999 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:41:24,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:41:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:41:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:41:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:41:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:41:25,002 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:41:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:25,003 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:41:25,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:41:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:41:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:41:25,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:25,003 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1] [2019-08-05 10:41:25,004 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:25,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:25,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2019-08-05 10:41:25,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:25,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-05 10:41:25,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:27,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:27,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:41:27,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:41:27,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:41:27,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:41:27,530 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2019-08-05 10:41:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:31,082 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:41:31,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:41:31,083 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2019-08-05 10:41:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:31,084 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:41:31,084 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:41:31,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:41:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:41:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:41:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:41:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:41:31,088 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:41:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:31,088 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:41:31,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:41:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:41:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:41:31,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:31,089 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1] [2019-08-05 10:41:31,089 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:31,089 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2019-08-05 10:41:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:31,121 WARN L254 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 265 conjunts are in the unsatisfiable core [2019-08-05 10:41:31,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:33,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:33,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:41:33,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:41:33,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:41:33,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:41:33,412 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2019-08-05 10:41:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:37,093 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:41:37,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:41:37,093 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2019-08-05 10:41:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:37,094 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:41:37,094 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:41:37,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:41:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:41:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:41:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:41:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:41:37,097 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:41:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:37,098 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:41:37,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:41:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:41:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:41:37,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:37,099 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1] [2019-08-05 10:41:37,099 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2019-08-05 10:41:37,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:37,123 WARN L254 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-05 10:41:37,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:39,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:39,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:41:39,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:41:39,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:41:39,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:41:39,432 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2019-08-05 10:41:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:43,188 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:41:43,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:41:43,189 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2019-08-05 10:41:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:43,190 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:41:43,190 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:41:43,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:41:43,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:41:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:41:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:41:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:41:43,192 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:41:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:43,192 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:41:43,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:41:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:41:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:41:43,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:43,193 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1] [2019-08-05 10:41:43,193 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:43,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:43,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2019-08-05 10:41:43,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:43,231 WARN L254 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 10:41:43,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:45,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:45,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:41:45,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:41:45,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:41:45,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:41:45,919 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2019-08-05 10:41:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:49,655 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:41:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:41:49,656 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2019-08-05 10:41:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:49,657 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:41:49,657 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:41:49,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:41:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:41:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:41:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:41:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:41:49,660 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:41:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:49,660 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:41:49,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:41:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:41:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:41:49,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:49,661 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1] [2019-08-05 10:41:49,661 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:49,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:49,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2019-08-05 10:41:49,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:49,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 277 conjunts are in the unsatisfiable core [2019-08-05 10:41:49,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:52,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:52,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:41:52,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:41:52,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:41:52,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:41:52,341 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2019-08-05 10:41:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:56,283 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:41:56,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:41:56,283 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2019-08-05 10:41:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:56,284 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:41:56,284 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:41:56,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:41:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:41:56,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:41:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:41:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:41:56,287 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:41:56,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:56,287 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:41:56,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:41:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:41:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:41:56,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:56,287 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1] [2019-08-05 10:41:56,288 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:56,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:56,288 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2019-08-05 10:41:56,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:56,315 WARN L254 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-05 10:41:56,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:58,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:58,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:41:58,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:41:58,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:41:58,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:41:58,883 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2019-08-05 10:42:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:02,933 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:42:02,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:42:02,933 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2019-08-05 10:42:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:02,934 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:42:02,934 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:42:02,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:42:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:42:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:42:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:42:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:42:02,944 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:42:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:02,945 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:42:02,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:42:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:42:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:42:02,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:02,946 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1] [2019-08-05 10:42:02,946 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:02,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:02,946 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2019-08-05 10:42:02,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:02,979 WARN L254 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-05 10:42:02,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:05,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:05,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:42:05,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:42:05,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:42:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:42:05,560 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2019-08-05 10:42:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:09,954 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:42:09,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:42:09,954 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2019-08-05 10:42:09,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:09,955 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:42:09,955 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:42:09,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:42:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:42:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:42:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:42:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:42:09,959 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:42:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:09,959 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:42:09,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:42:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:42:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:42:09,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:09,960 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1] [2019-08-05 10:42:09,960 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:09,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2019-08-05 10:42:09,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:10,000 WARN L254 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 289 conjunts are in the unsatisfiable core [2019-08-05 10:42:10,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:12,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:12,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:42:12,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:42:12,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:42:12,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:42:12,967 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2019-08-05 10:42:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:17,215 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:42:17,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:42:17,215 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2019-08-05 10:42:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:17,216 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:42:17,216 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:42:17,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:42:17,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:42:17,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:42:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:42:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:42:17,220 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:42:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:17,220 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:42:17,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:42:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:42:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:42:17,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:17,221 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1] [2019-08-05 10:42:17,221 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2019-08-05 10:42:17,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:17,260 WARN L254 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-05 10:42:17,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:21,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:21,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:42:21,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:42:21,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:42:21,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:42:21,404 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2019-08-05 10:42:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:25,812 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:42:25,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:42:25,812 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2019-08-05 10:42:25,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:25,813 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:42:25,813 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:42:25,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:42:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:42:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:42:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:42:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:42:25,817 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:42:25,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:25,817 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:42:25,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:42:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:42:25,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:42:25,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:25,818 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1] [2019-08-05 10:42:25,818 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:25,818 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2019-08-05 10:42:25,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:25,851 WARN L254 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 10:42:25,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:29,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:29,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:42:29,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:42:29,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:42:29,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:42:29,011 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2019-08-05 10:42:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:33,493 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:42:33,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:42:33,493 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2019-08-05 10:42:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:33,494 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:42:33,494 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:42:33,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:42:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:42:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:42:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:42:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:42:33,497 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:42:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:33,498 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:42:33,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:42:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:42:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:42:33,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:33,499 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1] [2019-08-05 10:42:33,499 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:33,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2019-08-05 10:42:33,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:33,549 WARN L254 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 301 conjunts are in the unsatisfiable core [2019-08-05 10:42:33,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:37,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:37,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:42:37,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:42:37,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:42:37,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:42:37,010 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2019-08-05 10:42:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:41,603 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:42:41,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:42:41,604 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2019-08-05 10:42:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:41,605 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:42:41,605 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:42:41,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:42:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:42:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:42:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:42:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:42:41,608 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:42:41,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:41,608 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:42:41,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:42:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:42:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:42:41,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:41,608 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1] [2019-08-05 10:42:41,609 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:41,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2019-08-05 10:42:41,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:41,642 WARN L254 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-05 10:42:41,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:44,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:44,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:42:44,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:42:44,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:42:44,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:42:44,861 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2019-08-05 10:42:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:49,530 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:42:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:42:49,530 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2019-08-05 10:42:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:49,531 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:42:49,531 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:42:49,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:42:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:42:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:42:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:42:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:42:49,534 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:42:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:49,534 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:42:49,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:42:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:42:49,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:42:49,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:49,535 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1] [2019-08-05 10:42:49,535 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:49,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:49,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2019-08-05 10:42:49,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:49,572 WARN L254 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 309 conjunts are in the unsatisfiable core [2019-08-05 10:42:49,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:54,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:54,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:42:54,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:42:54,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:42:54,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:42:54,481 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2019-08-05 10:42:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:59,367 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:42:59,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:42:59,367 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2019-08-05 10:42:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:59,368 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:42:59,368 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:42:59,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:42:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:42:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:42:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:42:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:42:59,371 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:42:59,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:59,372 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:42:59,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:42:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:42:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:42:59,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:59,373 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1] [2019-08-05 10:42:59,373 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:59,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:59,373 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2019-08-05 10:42:59,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:59,405 WARN L254 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 313 conjunts are in the unsatisfiable core [2019-08-05 10:42:59,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:02,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:02,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:43:02,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:43:02,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:43:02,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:43:02,760 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2019-08-05 10:43:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:07,764 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:43:07,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:43:07,765 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2019-08-05 10:43:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:07,766 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:43:07,766 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:43:07,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:43:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:43:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:43:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:43:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:43:07,769 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:43:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:07,769 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:43:07,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:43:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:43:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:43:07,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:07,770 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1] [2019-08-05 10:43:07,771 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:07,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:07,771 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2019-08-05 10:43:07,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:07,810 WARN L254 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-05 10:43:07,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:11,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:11,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:43:11,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:43:11,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:43:11,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:43:11,052 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. Received shutdown request... [2019-08-05 10:43:14,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:43:14,399 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:43:14,405 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:43:14,406 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:43:14 BoogieIcfgContainer [2019-08-05 10:43:14,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:43:14,408 INFO L168 Benchmark]: Toolchain (without parser) took 252954.71 ms. Allocated memory was 141.6 MB in the beginning and 217.1 MB in the end (delta: 75.5 MB). Free memory was 111.1 MB in the beginning and 62.1 MB in the end (delta: 49.0 MB). Peak memory consumption was 124.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:14,409 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.6 MB. Free memory was 112.4 MB in the beginning and 112.1 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:43:14,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.08 ms. Allocated memory is still 141.6 MB. Free memory was 111.1 MB in the beginning and 109.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:14,410 INFO L168 Benchmark]: Boogie Preprocessor took 25.40 ms. Allocated memory is still 141.6 MB. Free memory was 109.2 MB in the beginning and 108.2 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:43:14,411 INFO L168 Benchmark]: RCFGBuilder took 308.46 ms. Allocated memory is still 141.6 MB. Free memory was 108.0 MB in the beginning and 99.1 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:14,412 INFO L168 Benchmark]: TraceAbstraction took 252575.94 ms. Allocated memory was 141.6 MB in the beginning and 217.1 MB in the end (delta: 75.5 MB). Free memory was 98.7 MB in the beginning and 62.1 MB in the end (delta: 36.6 MB). Peak memory consumption was 112.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:14,417 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 141.6 MB. Free memory was 112.4 MB in the beginning and 112.1 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 40.08 ms. Allocated memory is still 141.6 MB. Free memory was 111.1 MB in the beginning and 109.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.40 ms. Allocated memory is still 141.6 MB. Free memory was 109.2 MB in the beginning and 108.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 308.46 ms. Allocated memory is still 141.6 MB. Free memory was 108.0 MB in the beginning and 99.1 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252575.94 ms. Allocated memory was 141.6 MB in the beginning and 217.1 MB in the end (delta: 75.5 MB). Free memory was 98.7 MB in the beginning and 62.1 MB in the end (delta: 36.6 MB). Peak memory consumption was 112.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and FLOYD_HOARE automaton (currently 51 states, 81 states before enhancement),while ReachableStatesComputation was computing reachable states (49 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. TIMEOUT Result, 252.5s OverallTime, 79 OverallIterations, 78 TraceHistogramMax, 139.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 157 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 171273 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 116.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3160 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 108.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 78 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 110.7s InterpolantComputationTime, 3239 NumberOfCodeBlocks, 3239 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 3160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1507320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 12877 ConjunctsInSsa, 12719 ConjunctsInUnsatCore, 79 InterpolantComputations, 1 PerfectInterpolantSequences, 0/82160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown