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/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:09:04,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:09:04,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:09:04,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:09:04,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:09:04,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:09:04,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:09:04,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:09:04,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:09:04,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:09:04,660 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:09:04,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:09:04,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:09:04,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:09:04,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:09:04,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:09:04,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:09:04,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:09:04,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:09:04,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:09:04,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:09:04,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:09:04,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:09:04,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:09:04,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:09:04,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:09:04,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:09:04,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:09:04,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:09:04,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:09:04,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:09:04,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:09:04,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:09:04,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:09:04,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:09:04,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:09:04,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:09:04,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:09:04,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:09:04,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:09:04,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:09:04,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:09:04,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:09:04,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:09:04,757 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:09:04,758 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:09:04,759 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2019-08-05 10:09:04,759 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2019-08-05 10:09:04,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:09:04,803 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:09:04,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:09:04,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:09:04,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:09:04,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:04" (1/1) ... [2019-08-05 10:09:04,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:04" (1/1) ... [2019-08-05 10:09:04,838 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:09:04,838 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:09:04,838 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:09:04,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:09:04,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:09:04,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:09:04,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:09:04,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:04" (1/1) ... [2019-08-05 10:09:04,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:04" (1/1) ... [2019-08-05 10:09:04,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:04" (1/1) ... [2019-08-05 10:09:04,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:04" (1/1) ... [2019-08-05 10:09:04,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:04" (1/1) ... [2019-08-05 10:09:04,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:04" (1/1) ... [2019-08-05 10:09:04,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:04" (1/1) ... [2019-08-05 10:09:04,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:09:04,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:09:04,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:09:04,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:09:04,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:09:04,935 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2019-08-05 10:09:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure product [2019-08-05 10:09:04,935 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2019-08-05 10:09:05,362 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint productFINAL: assume true; [2019-08-05 10:09:05,364 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:09:05,365 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:09:05,366 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:09:05 BoogieIcfgContainer [2019-08-05 10:09:05,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:09:05,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:09:05,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:09:05,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:09:05,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:04" (1/2) ... [2019-08-05 10:09:05,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cff18a9 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:09:05, skipping insertion in model container [2019-08-05 10:09:05,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:09:05" (2/2) ... [2019-08-05 10:09:05,374 INFO L109 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2019-08-05 10:09:05,383 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:09:05,391 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-08-05 10:09:05,406 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-08-05 10:09:05,429 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:09:05,430 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:09:05,430 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:09:05,430 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:09:05,430 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:09:05,431 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:09:05,431 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:09:05,431 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:09:05,431 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:09:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-08-05 10:09:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:09:05,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:05,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:09:05,457 INFO L418 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:05,463 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2019-08-05 10:09:05,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:05,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:09:05,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:05,693 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:09:05,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:05,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:05,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:05,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:05,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:05,716 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2019-08-05 10:09:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:06,235 INFO L93 Difference]: Finished difference Result 30 states and 49 transitions. [2019-08-05 10:09:06,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:06,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:09:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:06,249 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:09:06,249 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:09:06,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:09:06,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-08-05 10:09:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:09:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2019-08-05 10:09:06,281 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2019-08-05 10:09:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:06,282 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2019-08-05 10:09:06,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2019-08-05 10:09:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:09:06,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:06,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:09:06,293 INFO L418 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:06,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:06,293 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2019-08-05 10:09:06,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:06,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:09:06,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:06,403 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:09:06,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:06,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:06,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:06,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:06,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:06,406 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2019-08-05 10:09:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:06,718 INFO L93 Difference]: Finished difference Result 36 states and 59 transitions. [2019-08-05 10:09:06,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:06,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:09:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:06,720 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:09:06,720 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:09:06,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:09:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-08-05 10:09:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:09:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2019-08-05 10:09:06,727 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2019-08-05 10:09:06,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:06,728 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2019-08-05 10:09:06,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:06,728 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2019-08-05 10:09:06,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:09:06,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:06,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:09:06,729 INFO L418 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:06,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:06,730 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2019-08-05 10:09:06,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:06,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:09:06,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:06,829 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:09:06,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:06,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:09:06,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:09:06,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:09:06,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:06,832 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2019-08-05 10:09:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:07,385 INFO L93 Difference]: Finished difference Result 44 states and 73 transitions. [2019-08-05 10:09:07,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:07,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:09:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:07,390 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:09:07,391 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:09:07,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:09:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2019-08-05 10:09:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:09:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 55 transitions. [2019-08-05 10:09:07,398 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 55 transitions. Word has length 5 [2019-08-05 10:09:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:07,398 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 55 transitions. [2019-08-05 10:09:07,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:09:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 55 transitions. [2019-08-05 10:09:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:09:07,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:07,399 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:09:07,400 INFO L418 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:07,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:07,400 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2019-08-05 10:09:07,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:07,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:09:07,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:07,522 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:09:07,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:07,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:09:07,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:09:07,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:09:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:07,524 INFO L87 Difference]: Start difference. First operand 34 states and 55 transitions. Second operand 6 states. [2019-08-05 10:09:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:07,773 INFO L93 Difference]: Finished difference Result 48 states and 81 transitions. [2019-08-05 10:09:07,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:07,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:09:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:07,780 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:09:07,780 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:09:07,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:09:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-08-05 10:09:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:09:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2019-08-05 10:09:07,786 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 5 [2019-08-05 10:09:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:07,786 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2019-08-05 10:09:07,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:09:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2019-08-05 10:09:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:09:07,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:07,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:07,788 INFO L418 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:07,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:07,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2019-08-05 10:09:07,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:07,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:09:07,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:07,871 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:09:07,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:07,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:09:07,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:07,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:07,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:07,873 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 7 states. [2019-08-05 10:09:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:08,719 INFO L93 Difference]: Finished difference Result 94 states and 156 transitions. [2019-08-05 10:09:08,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:08,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:09:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:08,723 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:09:08,723 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:09:08,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:09:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:09:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 67. [2019-08-05 10:09:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:09:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 116 transitions. [2019-08-05 10:09:08,733 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 116 transitions. Word has length 8 [2019-08-05 10:09:08,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:08,733 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 116 transitions. [2019-08-05 10:09:08,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 116 transitions. [2019-08-05 10:09:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:09:08,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:08,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:08,735 INFO L418 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:08,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2019-08-05 10:09:08,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:08,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:09:08,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:09,169 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:09:09,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:09,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:09,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:09:09,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:09:09,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:09,171 INFO L87 Difference]: Start difference. First operand 67 states and 116 transitions. Second operand 8 states. [2019-08-05 10:09:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:09,953 INFO L93 Difference]: Finished difference Result 130 states and 212 transitions. [2019-08-05 10:09:09,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:09:09,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:09:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:09,956 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:09:09,956 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:09:09,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:09:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:09:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 89. [2019-08-05 10:09:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:09:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 156 transitions. [2019-08-05 10:09:09,967 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 156 transitions. Word has length 8 [2019-08-05 10:09:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:09,967 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 156 transitions. [2019-08-05 10:09:09,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:09:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 156 transitions. [2019-08-05 10:09:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:09:09,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:09,969 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:09,969 INFO L418 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1965444251, now seen corresponding path program 1 times [2019-08-05 10:09:09,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:09,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:09:09,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:10,082 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:09:10,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:10,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:09:10,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:10,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:10,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:10,083 INFO L87 Difference]: Start difference. First operand 89 states and 156 transitions. Second operand 7 states. [2019-08-05 10:09:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:10,378 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2019-08-05 10:09:10,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:09:10,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:09:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:10,380 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:09:10,380 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:09:10,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:09:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:09:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2019-08-05 10:09:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:09:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 158 transitions. [2019-08-05 10:09:10,399 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 158 transitions. Word has length 8 [2019-08-05 10:09:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:10,399 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 158 transitions. [2019-08-05 10:09:10,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 158 transitions. [2019-08-05 10:09:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:09:10,402 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:10,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:10,403 INFO L418 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:10,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:10,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2019-08-05 10:09:10,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:10,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:09:10,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:10,521 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:09:10,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:10,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:09:10,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:10,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:10,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:10,523 INFO L87 Difference]: Start difference. First operand 91 states and 158 transitions. Second operand 7 states. [2019-08-05 10:09:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:10,946 INFO L93 Difference]: Finished difference Result 151 states and 259 transitions. [2019-08-05 10:09:10,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:09:10,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:09:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:10,948 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:09:10,949 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:09:10,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:09:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:09:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2019-08-05 10:09:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:09:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 186 transitions. [2019-08-05 10:09:10,959 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 186 transitions. Word has length 8 [2019-08-05 10:09:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:10,959 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 186 transitions. [2019-08-05 10:09:10,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 186 transitions. [2019-08-05 10:09:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:09:10,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:10,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:10,961 INFO L418 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:10,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2019-08-05 10:09:10,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:10,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:09:10,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:11,032 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:09:11,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:11,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:09:11,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:11,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:11,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:11,033 INFO L87 Difference]: Start difference. First operand 105 states and 186 transitions. Second operand 7 states. [2019-08-05 10:09:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:11,306 INFO L93 Difference]: Finished difference Result 179 states and 311 transitions. [2019-08-05 10:09:11,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:09:11,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:09:11,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:11,309 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:09:11,309 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:09:11,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:09:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:09:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 138. [2019-08-05 10:09:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:09:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 244 transitions. [2019-08-05 10:09:11,318 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 244 transitions. Word has length 8 [2019-08-05 10:09:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:11,319 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 244 transitions. [2019-08-05 10:09:11,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 244 transitions. [2019-08-05 10:09:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:09:11,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:11,320 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:11,321 INFO L418 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:11,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:11,321 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2019-08-05 10:09:11,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:11,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:09:11,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:11,400 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:09:11,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:11,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:09:11,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:11,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:11,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:11,402 INFO L87 Difference]: Start difference. First operand 138 states and 244 transitions. Second operand 7 states. [2019-08-05 10:09:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:11,764 INFO L93 Difference]: Finished difference Result 211 states and 369 transitions. [2019-08-05 10:09:11,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:11,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:09:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:11,766 INFO L225 Difference]: With dead ends: 211 [2019-08-05 10:09:11,766 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 10:09:11,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:09:11,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 10:09:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 170. [2019-08-05 10:09:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 10:09:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 301 transitions. [2019-08-05 10:09:11,775 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 301 transitions. Word has length 8 [2019-08-05 10:09:11,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:11,775 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 301 transitions. [2019-08-05 10:09:11,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 301 transitions. [2019-08-05 10:09:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:09:11,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:11,777 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:11,777 INFO L418 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2019-08-05 10:09:11,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:11,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:09:11,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:11,846 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:09:11,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:11,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:09:11,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:11,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:11,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:11,848 INFO L87 Difference]: Start difference. First operand 170 states and 301 transitions. Second operand 7 states. [2019-08-05 10:09:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:12,199 INFO L93 Difference]: Finished difference Result 285 states and 503 transitions. [2019-08-05 10:09:12,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:09:12,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:09:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:12,202 INFO L225 Difference]: With dead ends: 285 [2019-08-05 10:09:12,203 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 10:09:12,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:09:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 10:09:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 203. [2019-08-05 10:09:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-05 10:09:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 363 transitions. [2019-08-05 10:09:12,211 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 363 transitions. Word has length 8 [2019-08-05 10:09:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:12,212 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 363 transitions. [2019-08-05 10:09:12,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 363 transitions. [2019-08-05 10:09:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:09:12,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:12,213 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:09:12,214 INFO L418 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:12,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:12,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1748588753, now seen corresponding path program 2 times [2019-08-05 10:09:12,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:12,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:12,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:12,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:12,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:12,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:12,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:12,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:12,332 INFO L87 Difference]: Start difference. First operand 203 states and 363 transitions. Second operand 7 states. [2019-08-05 10:09:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:12,788 INFO L93 Difference]: Finished difference Result 372 states and 663 transitions. [2019-08-05 10:09:12,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:09:12,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:09:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:12,795 INFO L225 Difference]: With dead ends: 372 [2019-08-05 10:09:12,795 INFO L226 Difference]: Without dead ends: 372 [2019-08-05 10:09:12,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:09:12,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-08-05 10:09:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 282. [2019-08-05 10:09:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-08-05 10:09:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 509 transitions. [2019-08-05 10:09:12,805 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 509 transitions. Word has length 11 [2019-08-05 10:09:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:12,805 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 509 transitions. [2019-08-05 10:09:12,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 509 transitions. [2019-08-05 10:09:12,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:09:12,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:12,807 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:12,807 INFO L418 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:12,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:12,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2019-08-05 10:09:12,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:12,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:12,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:12,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:12,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:12,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:12,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:12,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:12,892 INFO L87 Difference]: Start difference. First operand 282 states and 509 transitions. Second operand 7 states. [2019-08-05 10:09:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:13,671 INFO L93 Difference]: Finished difference Result 388 states and 689 transitions. [2019-08-05 10:09:13,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:13,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:09:13,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:13,675 INFO L225 Difference]: With dead ends: 388 [2019-08-05 10:09:13,675 INFO L226 Difference]: Without dead ends: 388 [2019-08-05 10:09:13,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:09:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-08-05 10:09:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 291. [2019-08-05 10:09:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-08-05 10:09:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 524 transitions. [2019-08-05 10:09:13,685 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 524 transitions. Word has length 11 [2019-08-05 10:09:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:13,685 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 524 transitions. [2019-08-05 10:09:13,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 524 transitions. [2019-08-05 10:09:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:09:13,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:13,694 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:13,694 INFO L418 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:13,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:13,695 INFO L82 PathProgramCache]: Analyzing trace with hash 707062982, now seen corresponding path program 2 times [2019-08-05 10:09:13,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:13,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:13,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:13,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:13,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:13,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:13,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:13,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:13,778 INFO L87 Difference]: Start difference. First operand 291 states and 524 transitions. Second operand 7 states. [2019-08-05 10:09:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:14,113 INFO L93 Difference]: Finished difference Result 404 states and 718 transitions. [2019-08-05 10:09:14,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:09:14,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:09:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:14,118 INFO L225 Difference]: With dead ends: 404 [2019-08-05 10:09:14,118 INFO L226 Difference]: Without dead ends: 404 [2019-08-05 10:09:14,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:09:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-08-05 10:09:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 315. [2019-08-05 10:09:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-08-05 10:09:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 568 transitions. [2019-08-05 10:09:14,127 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 568 transitions. Word has length 11 [2019-08-05 10:09:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:14,127 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 568 transitions. [2019-08-05 10:09:14,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 568 transitions. [2019-08-05 10:09:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:09:14,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:14,129 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:14,129 INFO L418 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:14,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:14,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1106732355, now seen corresponding path program 1 times [2019-08-05 10:09:14,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:14,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:14,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:14,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:14,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:14,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:14,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:14,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:14,219 INFO L87 Difference]: Start difference. First operand 315 states and 568 transitions. Second operand 7 states. [2019-08-05 10:09:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:14,824 INFO L93 Difference]: Finished difference Result 378 states and 668 transitions. [2019-08-05 10:09:14,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:09:14,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:09:14,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:14,827 INFO L225 Difference]: With dead ends: 378 [2019-08-05 10:09:14,827 INFO L226 Difference]: Without dead ends: 378 [2019-08-05 10:09:14,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:09:14,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-08-05 10:09:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 301. [2019-08-05 10:09:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-08-05 10:09:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 541 transitions. [2019-08-05 10:09:14,840 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 541 transitions. Word has length 11 [2019-08-05 10:09:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:14,840 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 541 transitions. [2019-08-05 10:09:14,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:14,840 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 541 transitions. [2019-08-05 10:09:14,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:09:14,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:14,841 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:14,842 INFO L418 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:14,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:14,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2019-08-05 10:09:14,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:14,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:14,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:15,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:15,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:15,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:15,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:15,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:15,374 INFO L87 Difference]: Start difference. First operand 301 states and 541 transitions. Second operand 7 states. [2019-08-05 10:09:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:17,220 INFO L93 Difference]: Finished difference Result 347 states and 608 transitions. [2019-08-05 10:09:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:09:17,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:09:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:17,224 INFO L225 Difference]: With dead ends: 347 [2019-08-05 10:09:17,224 INFO L226 Difference]: Without dead ends: 347 [2019-08-05 10:09:17,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:09:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-08-05 10:09:17,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 279. [2019-08-05 10:09:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-08-05 10:09:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 499 transitions. [2019-08-05 10:09:17,233 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 499 transitions. Word has length 11 [2019-08-05 10:09:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:17,233 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 499 transitions. [2019-08-05 10:09:17,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 499 transitions. [2019-08-05 10:09:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:09:17,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:17,234 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:17,235 INFO L418 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:17,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:17,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1387219104, now seen corresponding path program 1 times [2019-08-05 10:09:17,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:17,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:17,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:17,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:17,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:17,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:17,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:17,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:17,306 INFO L87 Difference]: Start difference. First operand 279 states and 499 transitions. Second operand 7 states. [2019-08-05 10:09:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:17,835 INFO L93 Difference]: Finished difference Result 352 states and 617 transitions. [2019-08-05 10:09:17,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:17,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:09:17,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:17,838 INFO L225 Difference]: With dead ends: 352 [2019-08-05 10:09:17,838 INFO L226 Difference]: Without dead ends: 352 [2019-08-05 10:09:17,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:09:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-08-05 10:09:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 278. [2019-08-05 10:09:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-08-05 10:09:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 497 transitions. [2019-08-05 10:09:17,845 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 497 transitions. Word has length 11 [2019-08-05 10:09:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:17,845 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 497 transitions. [2019-08-05 10:09:17,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 497 transitions. [2019-08-05 10:09:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:09:17,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:17,846 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:17,846 INFO L418 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:17,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:17,847 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2019-08-05 10:09:17,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:17,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:17,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:17,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:17,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:17,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:17,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:17,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:17,920 INFO L87 Difference]: Start difference. First operand 278 states and 497 transitions. Second operand 7 states. [2019-08-05 10:09:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:18,282 INFO L93 Difference]: Finished difference Result 427 states and 757 transitions. [2019-08-05 10:09:18,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:09:18,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:09:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:18,287 INFO L225 Difference]: With dead ends: 427 [2019-08-05 10:09:18,287 INFO L226 Difference]: Without dead ends: 427 [2019-08-05 10:09:18,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:09:18,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-08-05 10:09:18,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 365. [2019-08-05 10:09:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-08-05 10:09:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 655 transitions. [2019-08-05 10:09:18,296 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 655 transitions. Word has length 11 [2019-08-05 10:09:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:18,296 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 655 transitions. [2019-08-05 10:09:18,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 655 transitions. [2019-08-05 10:09:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:09:18,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:18,298 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:18,298 INFO L418 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:18,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:18,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2019-08-05 10:09:18,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:18,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:18,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:18,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:18,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:18,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:18,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:18,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:18,404 INFO L87 Difference]: Start difference. First operand 365 states and 655 transitions. Second operand 7 states. [2019-08-05 10:09:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:18,852 INFO L93 Difference]: Finished difference Result 458 states and 809 transitions. [2019-08-05 10:09:18,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:18,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:09:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:18,858 INFO L225 Difference]: With dead ends: 458 [2019-08-05 10:09:18,858 INFO L226 Difference]: Without dead ends: 458 [2019-08-05 10:09:18,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:09:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-08-05 10:09:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 379. [2019-08-05 10:09:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-08-05 10:09:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 681 transitions. [2019-08-05 10:09:18,867 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 681 transitions. Word has length 11 [2019-08-05 10:09:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:18,867 INFO L475 AbstractCegarLoop]: Abstraction has 379 states and 681 transitions. [2019-08-05 10:09:18,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 681 transitions. [2019-08-05 10:09:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:09:18,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:18,868 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:09:18,869 INFO L418 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1682741169, now seen corresponding path program 2 times [2019-08-05 10:09:18,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:18,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:18,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:18,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:18,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:18,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:18,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:18,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:18,992 INFO L87 Difference]: Start difference. First operand 379 states and 681 transitions. Second operand 7 states. [2019-08-05 10:09:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:19,368 INFO L93 Difference]: Finished difference Result 472 states and 837 transitions. [2019-08-05 10:09:19,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:09:19,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:09:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:19,371 INFO L225 Difference]: With dead ends: 472 [2019-08-05 10:09:19,372 INFO L226 Difference]: Without dead ends: 472 [2019-08-05 10:09:19,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:09:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-08-05 10:09:19,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 412. [2019-08-05 10:09:19,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-08-05 10:09:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 739 transitions. [2019-08-05 10:09:19,382 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 739 transitions. Word has length 11 [2019-08-05 10:09:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:19,382 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 739 transitions. [2019-08-05 10:09:19,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 739 transitions. [2019-08-05 10:09:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:09:19,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:19,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:19,384 INFO L418 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:19,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2019-08-05 10:09:19,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:19,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:19,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:19,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:19,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:19,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:19,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:19,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:19,735 INFO L87 Difference]: Start difference. First operand 412 states and 739 transitions. Second operand 7 states. [2019-08-05 10:09:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:19,999 INFO L93 Difference]: Finished difference Result 447 states and 785 transitions. [2019-08-05 10:09:20,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:09:20,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:09:20,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:20,003 INFO L225 Difference]: With dead ends: 447 [2019-08-05 10:09:20,003 INFO L226 Difference]: Without dead ends: 447 [2019-08-05 10:09:20,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:09:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-08-05 10:09:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 400. [2019-08-05 10:09:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-08-05 10:09:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 713 transitions. [2019-08-05 10:09:20,012 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 713 transitions. Word has length 11 [2019-08-05 10:09:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:20,013 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 713 transitions. [2019-08-05 10:09:20,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 713 transitions. [2019-08-05 10:09:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:09:20,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:20,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:20,014 INFO L418 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:20,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1918663185, now seen corresponding path program 1 times [2019-08-05 10:09:20,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:20,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:20,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:20,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:20,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:20,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:20,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:20,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:20,114 INFO L87 Difference]: Start difference. First operand 400 states and 713 transitions. Second operand 7 states. [2019-08-05 10:09:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:20,829 INFO L93 Difference]: Finished difference Result 461 states and 809 transitions. [2019-08-05 10:09:20,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:09:20,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:09:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:20,835 INFO L225 Difference]: With dead ends: 461 [2019-08-05 10:09:20,835 INFO L226 Difference]: Without dead ends: 461 [2019-08-05 10:09:20,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:09:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-08-05 10:09:20,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 372. [2019-08-05 10:09:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-08-05 10:09:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 663 transitions. [2019-08-05 10:09:20,843 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 663 transitions. Word has length 11 [2019-08-05 10:09:20,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:20,843 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 663 transitions. [2019-08-05 10:09:20,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 663 transitions. [2019-08-05 10:09:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:09:20,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:20,844 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:20,844 INFO L418 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:20,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:20,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2019-08-05 10:09:20,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:20,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:20,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:20,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:20,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:20,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:20,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:20,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:20,941 INFO L87 Difference]: Start difference. First operand 372 states and 663 transitions. Second operand 7 states. [2019-08-05 10:09:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:21,214 INFO L93 Difference]: Finished difference Result 438 states and 767 transitions. [2019-08-05 10:09:21,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:21,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:09:21,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:21,217 INFO L225 Difference]: With dead ends: 438 [2019-08-05 10:09:21,218 INFO L226 Difference]: Without dead ends: 438 [2019-08-05 10:09:21,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:09:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-08-05 10:09:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 364. [2019-08-05 10:09:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-08-05 10:09:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 647 transitions. [2019-08-05 10:09:21,225 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 647 transitions. Word has length 11 [2019-08-05 10:09:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:21,225 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 647 transitions. [2019-08-05 10:09:21,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 647 transitions. [2019-08-05 10:09:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:09:21,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:21,226 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:21,227 INFO L418 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:21,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:21,227 INFO L82 PathProgramCache]: Analyzing trace with hash -54183977, now seen corresponding path program 1 times [2019-08-05 10:09:21,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:21,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:21,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:21,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:21,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:21,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:21,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:21,340 INFO L87 Difference]: Start difference. First operand 364 states and 647 transitions. Second operand 9 states. [2019-08-05 10:09:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:21,788 INFO L93 Difference]: Finished difference Result 542 states and 969 transitions. [2019-08-05 10:09:21,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:09:21,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 10:09:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:21,791 INFO L225 Difference]: With dead ends: 542 [2019-08-05 10:09:21,792 INFO L226 Difference]: Without dead ends: 542 [2019-08-05 10:09:21,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:09:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-08-05 10:09:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 273. [2019-08-05 10:09:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-08-05 10:09:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 483 transitions. [2019-08-05 10:09:21,800 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 483 transitions. Word has length 12 [2019-08-05 10:09:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:21,800 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 483 transitions. [2019-08-05 10:09:21,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 483 transitions. [2019-08-05 10:09:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:09:21,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:21,801 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:21,802 INFO L418 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:21,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2019-08-05 10:09:21,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:21,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:21,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:21,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:21,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:21,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:21,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:21,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:21,910 INFO L87 Difference]: Start difference. First operand 273 states and 483 transitions. Second operand 9 states. [2019-08-05 10:09:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:22,294 INFO L93 Difference]: Finished difference Result 373 states and 662 transitions. [2019-08-05 10:09:22,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:09:22,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 10:09:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:22,297 INFO L225 Difference]: With dead ends: 373 [2019-08-05 10:09:22,298 INFO L226 Difference]: Without dead ends: 373 [2019-08-05 10:09:22,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:09:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-08-05 10:09:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 186. [2019-08-05 10:09:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 10:09:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 327 transitions. [2019-08-05 10:09:22,302 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 327 transitions. Word has length 12 [2019-08-05 10:09:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:22,303 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 327 transitions. [2019-08-05 10:09:22,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 327 transitions. [2019-08-05 10:09:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:22,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:22,304 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:09:22,304 INFO L418 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:22,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:22,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2019-08-05 10:09:22,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:22,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:22,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:22,503 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:09:22,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:22,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:22,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:22,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:22,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:22,504 INFO L87 Difference]: Start difference. First operand 186 states and 327 transitions. Second operand 9 states. [2019-08-05 10:09:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:22,959 INFO L93 Difference]: Finished difference Result 313 states and 542 transitions. [2019-08-05 10:09:22,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:09:22,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:22,962 INFO L225 Difference]: With dead ends: 313 [2019-08-05 10:09:22,962 INFO L226 Difference]: Without dead ends: 313 [2019-08-05 10:09:22,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:09:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-08-05 10:09:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 205. [2019-08-05 10:09:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-05 10:09:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 362 transitions. [2019-08-05 10:09:22,967 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 362 transitions. Word has length 15 [2019-08-05 10:09:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:22,967 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 362 transitions. [2019-08-05 10:09:22,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 362 transitions. [2019-08-05 10:09:22,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:22,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:22,968 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:09:22,968 INFO L418 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:22,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:22,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1863284942, now seen corresponding path program 2 times [2019-08-05 10:09:22,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:22,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:22,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:23,088 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:09:23,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:23,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:23,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:23,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:23,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:23,090 INFO L87 Difference]: Start difference. First operand 205 states and 362 transitions. Second operand 9 states. [2019-08-05 10:09:23,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:23,606 INFO L93 Difference]: Finished difference Result 273 states and 470 transitions. [2019-08-05 10:09:23,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:09:23,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:23,609 INFO L225 Difference]: With dead ends: 273 [2019-08-05 10:09:23,609 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 10:09:23,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:09:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 10:09:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 217. [2019-08-05 10:09:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-08-05 10:09:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 385 transitions. [2019-08-05 10:09:23,614 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 385 transitions. Word has length 15 [2019-08-05 10:09:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:23,614 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 385 transitions. [2019-08-05 10:09:23,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 385 transitions. [2019-08-05 10:09:23,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:23,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:23,615 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:23,616 INFO L418 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:23,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:23,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1871873111, now seen corresponding path program 1 times [2019-08-05 10:09:23,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:23,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:09:23,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:24,030 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:09:24,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:24,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:24,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:24,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:24,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:24,031 INFO L87 Difference]: Start difference. First operand 217 states and 385 transitions. Second operand 9 states. [2019-08-05 10:09:24,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:24,575 INFO L93 Difference]: Finished difference Result 266 states and 459 transitions. [2019-08-05 10:09:24,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:09:24,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:24,577 INFO L225 Difference]: With dead ends: 266 [2019-08-05 10:09:24,578 INFO L226 Difference]: Without dead ends: 266 [2019-08-05 10:09:24,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:09:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-08-05 10:09:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 225. [2019-08-05 10:09:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-08-05 10:09:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 400 transitions. [2019-08-05 10:09:24,583 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 400 transitions. Word has length 15 [2019-08-05 10:09:24,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:24,583 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 400 transitions. [2019-08-05 10:09:24,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 400 transitions. [2019-08-05 10:09:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:24,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:24,584 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:09:24,584 INFO L418 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:24,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:24,585 INFO L82 PathProgramCache]: Analyzing trace with hash 718510768, now seen corresponding path program 3 times [2019-08-05 10:09:24,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:24,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:24,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:24,649 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:09:24,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:24,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:24,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:24,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:24,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:24,651 INFO L87 Difference]: Start difference. First operand 225 states and 400 transitions. Second operand 9 states. [2019-08-05 10:09:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:25,194 INFO L93 Difference]: Finished difference Result 273 states and 474 transitions. [2019-08-05 10:09:25,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:09:25,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:25,197 INFO L225 Difference]: With dead ends: 273 [2019-08-05 10:09:25,197 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 10:09:25,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:09:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 10:09:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 210. [2019-08-05 10:09:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-08-05 10:09:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 372 transitions. [2019-08-05 10:09:25,201 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 372 transitions. Word has length 15 [2019-08-05 10:09:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:25,201 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 372 transitions. [2019-08-05 10:09:25,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 372 transitions. [2019-08-05 10:09:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:25,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:25,202 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:25,202 INFO L418 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:25,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:25,203 INFO L82 PathProgramCache]: Analyzing trace with hash 727098937, now seen corresponding path program 2 times [2019-08-05 10:09:25,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:25,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:09:25,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:25,356 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:09:25,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:25,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:25,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:25,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:25,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:25,357 INFO L87 Difference]: Start difference. First operand 210 states and 372 transitions. Second operand 9 states. [2019-08-05 10:09:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:26,329 INFO L93 Difference]: Finished difference Result 307 states and 521 transitions. [2019-08-05 10:09:26,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:09:26,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:26,332 INFO L225 Difference]: With dead ends: 307 [2019-08-05 10:09:26,332 INFO L226 Difference]: Without dead ends: 307 [2019-08-05 10:09:26,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:09:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-08-05 10:09:26,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 227. [2019-08-05 10:09:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-08-05 10:09:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 403 transitions. [2019-08-05 10:09:26,336 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 403 transitions. Word has length 15 [2019-08-05 10:09:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:26,336 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 403 transitions. [2019-08-05 10:09:26,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 403 transitions. [2019-08-05 10:09:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:26,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:26,337 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:26,337 INFO L418 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:26,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1120804793, now seen corresponding path program 3 times [2019-08-05 10:09:26,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:26,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:09:26,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:26,406 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:09:26,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:26,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:26,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:26,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:26,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:26,407 INFO L87 Difference]: Start difference. First operand 227 states and 403 transitions. Second operand 9 states. [2019-08-05 10:09:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:27,060 INFO L93 Difference]: Finished difference Result 305 states and 531 transitions. [2019-08-05 10:09:27,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:09:27,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:27,070 INFO L225 Difference]: With dead ends: 305 [2019-08-05 10:09:27,070 INFO L226 Difference]: Without dead ends: 305 [2019-08-05 10:09:27,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:09:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-05 10:09:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 237. [2019-08-05 10:09:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-08-05 10:09:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 421 transitions. [2019-08-05 10:09:27,075 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 421 transitions. Word has length 15 [2019-08-05 10:09:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:27,075 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 421 transitions. [2019-08-05 10:09:27,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 421 transitions. [2019-08-05 10:09:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:27,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:27,076 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:27,076 INFO L418 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:27,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:27,077 INFO L82 PathProgramCache]: Analyzing trace with hash -21431298, now seen corresponding path program 1 times [2019-08-05 10:09:27,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:27,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:27,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:27,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:27,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:27,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:27,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:27,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:27,442 INFO L87 Difference]: Start difference. First operand 237 states and 421 transitions. Second operand 9 states. [2019-08-05 10:09:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:27,784 INFO L93 Difference]: Finished difference Result 363 states and 636 transitions. [2019-08-05 10:09:27,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:09:27,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:27,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:27,787 INFO L225 Difference]: With dead ends: 363 [2019-08-05 10:09:27,787 INFO L226 Difference]: Without dead ends: 363 [2019-08-05 10:09:27,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:09:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-08-05 10:09:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 200. [2019-08-05 10:09:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:09:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 352 transitions. [2019-08-05 10:09:27,792 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 352 transitions. Word has length 15 [2019-08-05 10:09:27,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:27,792 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 352 transitions. [2019-08-05 10:09:27,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 352 transitions. [2019-08-05 10:09:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:27,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:27,793 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:27,793 INFO L418 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:27,794 INFO L82 PathProgramCache]: Analyzing trace with hash -185535140, now seen corresponding path program 2 times [2019-08-05 10:09:27,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:27,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:27,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:27,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:27,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:27,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:27,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:27,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:27,913 INFO L87 Difference]: Start difference. First operand 200 states and 352 transitions. Second operand 9 states. [2019-08-05 10:09:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:28,322 INFO L93 Difference]: Finished difference Result 319 states and 554 transitions. [2019-08-05 10:09:28,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:09:28,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:28,325 INFO L225 Difference]: With dead ends: 319 [2019-08-05 10:09:28,325 INFO L226 Difference]: Without dead ends: 319 [2019-08-05 10:09:28,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:09:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-08-05 10:09:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 167. [2019-08-05 10:09:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-05 10:09:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 288 transitions. [2019-08-05 10:09:28,340 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 288 transitions. Word has length 15 [2019-08-05 10:09:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:28,340 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 288 transitions. [2019-08-05 10:09:28,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 288 transitions. [2019-08-05 10:09:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:28,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:28,341 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:28,341 INFO L418 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash -176946971, now seen corresponding path program 1 times [2019-08-05 10:09:28,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:28,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:09:28,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:28,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:28,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:28,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:28,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:28,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:28,452 INFO L87 Difference]: Start difference. First operand 167 states and 288 transitions. Second operand 9 states. [2019-08-05 10:09:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:28,969 INFO L93 Difference]: Finished difference Result 203 states and 334 transitions. [2019-08-05 10:09:28,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:28,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:28,971 INFO L225 Difference]: With dead ends: 203 [2019-08-05 10:09:28,971 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 10:09:28,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:09:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 10:09:28,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 152. [2019-08-05 10:09:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 10:09:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 260 transitions. [2019-08-05 10:09:28,974 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 260 transitions. Word has length 15 [2019-08-05 10:09:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:28,974 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 260 transitions. [2019-08-05 10:09:28,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 260 transitions. [2019-08-05 10:09:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:28,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:28,975 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:28,975 INFO L418 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:28,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:28,976 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2019-08-05 10:09:28,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:28,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:28,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:29,023 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:09:29,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:29,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:29,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:29,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:29,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:29,024 INFO L87 Difference]: Start difference. First operand 152 states and 260 transitions. Second operand 9 states. [2019-08-05 10:09:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:29,441 INFO L93 Difference]: Finished difference Result 193 states and 333 transitions. [2019-08-05 10:09:29,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:09:29,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:29,443 INFO L225 Difference]: With dead ends: 193 [2019-08-05 10:09:29,443 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 10:09:29,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:09:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 10:09:29,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 146. [2019-08-05 10:09:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:09:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 249 transitions. [2019-08-05 10:09:29,446 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 249 transitions. Word has length 15 [2019-08-05 10:09:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:29,446 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 249 transitions. [2019-08-05 10:09:29,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 249 transitions. [2019-08-05 10:09:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:29,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:29,447 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:29,447 INFO L418 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:29,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:29,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1949120374, now seen corresponding path program 2 times [2019-08-05 10:09:29,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:29,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:29,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:29,512 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:09:29,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:29,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:29,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:29,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:29,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:29,513 INFO L87 Difference]: Start difference. First operand 146 states and 249 transitions. Second operand 9 states. [2019-08-05 10:09:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:30,024 INFO L93 Difference]: Finished difference Result 193 states and 328 transitions. [2019-08-05 10:09:30,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:09:30,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:30,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:30,026 INFO L225 Difference]: With dead ends: 193 [2019-08-05 10:09:30,026 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 10:09:30,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:09:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 10:09:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 146. [2019-08-05 10:09:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:09:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 248 transitions. [2019-08-05 10:09:30,030 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 248 transitions. Word has length 15 [2019-08-05 10:09:30,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:30,030 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 248 transitions. [2019-08-05 10:09:30,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 248 transitions. [2019-08-05 10:09:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:30,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:30,031 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:09:30,031 INFO L418 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:30,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:30,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2019-08-05 10:09:30,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:30,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:30,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:30,142 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:09:30,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:30,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:30,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:30,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:30,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:30,144 INFO L87 Difference]: Start difference. First operand 146 states and 248 transitions. Second operand 9 states. [2019-08-05 10:09:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:30,857 INFO L93 Difference]: Finished difference Result 197 states and 336 transitions. [2019-08-05 10:09:30,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:09:30,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:30,859 INFO L225 Difference]: With dead ends: 197 [2019-08-05 10:09:30,859 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 10:09:30,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:09:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 10:09:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 133. [2019-08-05 10:09:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:09:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 227 transitions. [2019-08-05 10:09:30,862 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 227 transitions. Word has length 15 [2019-08-05 10:09:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:30,863 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 227 transitions. [2019-08-05 10:09:30,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 227 transitions. [2019-08-05 10:09:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:30,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:30,864 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:30,864 INFO L418 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:30,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1652283980, now seen corresponding path program 1 times [2019-08-05 10:09:30,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:30,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:30,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:30,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:30,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:30,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:30,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:30,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:30,920 INFO L87 Difference]: Start difference. First operand 133 states and 227 transitions. Second operand 9 states. [2019-08-05 10:09:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:31,338 INFO L93 Difference]: Finished difference Result 175 states and 295 transitions. [2019-08-05 10:09:31,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:31,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:31,340 INFO L225 Difference]: With dead ends: 175 [2019-08-05 10:09:31,340 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 10:09:31,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:09:31,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 10:09:31,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 143. [2019-08-05 10:09:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:09:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 244 transitions. [2019-08-05 10:09:31,343 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 244 transitions. Word has length 15 [2019-08-05 10:09:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:31,344 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 244 transitions. [2019-08-05 10:09:31,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 244 transitions. [2019-08-05 10:09:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:31,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:31,345 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:31,345 INFO L418 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:31,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1643695811, now seen corresponding path program 1 times [2019-08-05 10:09:31,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:31,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:31,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:31,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:31,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:31,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:31,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:31,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:31,491 INFO L87 Difference]: Start difference. First operand 143 states and 244 transitions. Second operand 9 states. [2019-08-05 10:09:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:32,016 INFO L93 Difference]: Finished difference Result 186 states and 315 transitions. [2019-08-05 10:09:32,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:09:32,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:32,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:32,018 INFO L225 Difference]: With dead ends: 186 [2019-08-05 10:09:32,018 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:09:32,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:09:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:09:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 138. [2019-08-05 10:09:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:09:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 236 transitions. [2019-08-05 10:09:32,022 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 236 transitions. Word has length 15 [2019-08-05 10:09:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:32,022 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 236 transitions. [2019-08-05 10:09:32,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 236 transitions. [2019-08-05 10:09:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:32,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:32,023 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:32,023 INFO L418 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:32,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:32,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1603552790, now seen corresponding path program 1 times [2019-08-05 10:09:32,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:32,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:32,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:32,826 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:09:32,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:32,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:32,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:32,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:32,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:32,827 INFO L87 Difference]: Start difference. First operand 138 states and 236 transitions. Second operand 9 states. [2019-08-05 10:09:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:33,376 INFO L93 Difference]: Finished difference Result 200 states and 342 transitions. [2019-08-05 10:09:33,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:09:33,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:33,378 INFO L225 Difference]: With dead ends: 200 [2019-08-05 10:09:33,378 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 10:09:33,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:09:33,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 10:09:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 133. [2019-08-05 10:09:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:09:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 227 transitions. [2019-08-05 10:09:33,381 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 227 transitions. Word has length 15 [2019-08-05 10:09:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:33,382 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 227 transitions. [2019-08-05 10:09:33,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 227 transitions. [2019-08-05 10:09:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:33,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:33,382 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:33,383 INFO L418 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:33,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash -38294824, now seen corresponding path program 2 times [2019-08-05 10:09:33,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:33,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:33,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:33,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:33,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:33,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:33,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:33,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:33,500 INFO L87 Difference]: Start difference. First operand 133 states and 227 transitions. Second operand 9 states. [2019-08-05 10:09:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:33,888 INFO L93 Difference]: Finished difference Result 202 states and 347 transitions. [2019-08-05 10:09:33,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:09:33,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:33,889 INFO L225 Difference]: With dead ends: 202 [2019-08-05 10:09:33,890 INFO L226 Difference]: Without dead ends: 202 [2019-08-05 10:09:33,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:09:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-05 10:09:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 127. [2019-08-05 10:09:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:09:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 218 transitions. [2019-08-05 10:09:33,893 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 218 transitions. Word has length 15 [2019-08-05 10:09:33,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:33,893 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 218 transitions. [2019-08-05 10:09:33,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 218 transitions. [2019-08-05 10:09:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:33,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:33,893 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:33,894 INFO L418 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:33,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:33,894 INFO L82 PathProgramCache]: Analyzing trace with hash -29706655, now seen corresponding path program 2 times [2019-08-05 10:09:33,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:33,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:33,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:33,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:33,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:33,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:33,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:33,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:33,939 INFO L87 Difference]: Start difference. First operand 127 states and 218 transitions. Second operand 9 states. [2019-08-05 10:09:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:34,356 INFO L93 Difference]: Finished difference Result 212 states and 365 transitions. [2019-08-05 10:09:34,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:09:34,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:34,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:34,358 INFO L225 Difference]: With dead ends: 212 [2019-08-05 10:09:34,358 INFO L226 Difference]: Without dead ends: 212 [2019-08-05 10:09:34,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:09:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-05 10:09:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 111. [2019-08-05 10:09:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:09:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 189 transitions. [2019-08-05 10:09:34,361 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 189 transitions. Word has length 15 [2019-08-05 10:09:34,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:34,361 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 189 transitions. [2019-08-05 10:09:34,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:34,361 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 189 transitions. [2019-08-05 10:09:34,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:09:34,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:34,362 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:34,362 INFO L418 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:34,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:34,362 INFO L82 PathProgramCache]: Analyzing trace with hash 10436366, now seen corresponding path program 2 times [2019-08-05 10:09:34,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:34,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:34,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:34,608 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:09:34,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:34,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:34,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:34,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:34,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:34,609 INFO L87 Difference]: Start difference. First operand 111 states and 189 transitions. Second operand 9 states. [2019-08-05 10:09:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:34,948 INFO L93 Difference]: Finished difference Result 160 states and 273 transitions. [2019-08-05 10:09:34,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:09:34,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:09:34,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:34,949 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:09:34,950 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 10:09:34,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:09:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 10:09:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 61. [2019-08-05 10:09:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:09:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 99 transitions. [2019-08-05 10:09:34,952 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 99 transitions. Word has length 15 [2019-08-05 10:09:34,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:34,953 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 99 transitions. [2019-08-05 10:09:34,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 99 transitions. [2019-08-05 10:09:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:09:34,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:34,953 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:34,953 INFO L418 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:34,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:34,954 INFO L82 PathProgramCache]: Analyzing trace with hash -322212234, now seen corresponding path program 4 times [2019-08-05 10:09:34,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:34,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:09:34,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:35,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:35,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:09:35,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:09:35,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:09:35,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:09:35,168 INFO L87 Difference]: Start difference. First operand 61 states and 99 transitions. Second operand 11 states. [2019-08-05 10:09:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:36,110 INFO L93 Difference]: Finished difference Result 132 states and 211 transitions. [2019-08-05 10:09:36,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:09:36,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 10:09:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:36,112 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:09:36,112 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:09:36,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:09:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:09:36,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 76. [2019-08-05 10:09:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:09:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 126 transitions. [2019-08-05 10:09:36,114 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 126 transitions. Word has length 19 [2019-08-05 10:09:36,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:36,114 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 126 transitions. [2019-08-05 10:09:36,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:09:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 126 transitions. [2019-08-05 10:09:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:09:36,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:36,115 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:36,115 INFO L418 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:36,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:36,115 INFO L82 PathProgramCache]: Analyzing trace with hash 67620696, now seen corresponding path program 5 times [2019-08-05 10:09:36,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:36,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:09:36,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:36,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:36,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:09:36,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:09:36,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:09:36,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:09:36,309 INFO L87 Difference]: Start difference. First operand 76 states and 126 transitions. Second operand 11 states. [2019-08-05 10:09:37,056 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:09:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:37,717 INFO L93 Difference]: Finished difference Result 121 states and 197 transitions. [2019-08-05 10:09:37,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:09:37,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 10:09:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:37,718 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:09:37,718 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:09:37,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:09:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:09:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 67. [2019-08-05 10:09:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:09:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 110 transitions. [2019-08-05 10:09:37,721 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 110 transitions. Word has length 19 [2019-08-05 10:09:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:37,721 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 110 transitions. [2019-08-05 10:09:37,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:09:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 110 transitions. [2019-08-05 10:09:37,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:09:37,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:37,722 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:37,722 INFO L418 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:37,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:37,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1077153478, now seen corresponding path program 6 times [2019-08-05 10:09:37,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:37,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:09:37,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:37,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:37,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:09:37,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:09:37,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:09:37,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:09:37,859 INFO L87 Difference]: Start difference. First operand 67 states and 110 transitions. Second operand 11 states. [2019-08-05 10:09:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:39,814 INFO L93 Difference]: Finished difference Result 109 states and 181 transitions. [2019-08-05 10:09:39,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:09:39,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 10:09:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:39,815 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:09:39,816 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:09:39,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:09:39,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:09:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63. [2019-08-05 10:09:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:09:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 103 transitions. [2019-08-05 10:09:39,818 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 103 transitions. Word has length 19 [2019-08-05 10:09:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:39,818 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 103 transitions. [2019-08-05 10:09:39,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:09:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 103 transitions. [2019-08-05 10:09:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:09:39,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:39,819 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:39,819 INFO L418 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:39,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:39,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1369910088, now seen corresponding path program 7 times [2019-08-05 10:09:39,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:39,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:09:39,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:40,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:40,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:09:40,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:09:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:09:40,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=88, Unknown=1, NotChecked=0, Total=110 [2019-08-05 10:09:40,312 INFO L87 Difference]: Start difference. First operand 63 states and 103 transitions. Second operand 11 states. [2019-08-05 10:09:44,867 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-08-05 10:09:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:48,923 INFO L93 Difference]: Finished difference Result 102 states and 171 transitions. [2019-08-05 10:09:48,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:09:48,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 10:09:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:48,924 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:09:48,925 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:09:48,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=109, Invalid=301, Unknown=10, NotChecked=0, Total=420 [2019-08-05 10:09:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:09:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2019-08-05 10:09:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:09:48,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 117 transitions. [2019-08-05 10:09:48,928 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 117 transitions. Word has length 19 [2019-08-05 10:09:48,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:48,928 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 117 transitions. [2019-08-05 10:09:48,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:09:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 117 transitions. [2019-08-05 10:09:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:09:48,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:48,929 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:48,929 INFO L418 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:48,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1969222660, now seen corresponding path program 2 times [2019-08-05 10:09:48,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:48,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:09:48,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:49,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:49,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:09:49,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:09:49,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:09:49,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:09:49,053 INFO L87 Difference]: Start difference. First operand 71 states and 117 transitions. Second operand 11 states. [2019-08-05 10:09:49,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:49,748 INFO L93 Difference]: Finished difference Result 91 states and 147 transitions. [2019-08-05 10:09:49,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:49,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 10:09:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:49,749 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:09:49,749 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:09:49,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:09:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:09:49,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 52. [2019-08-05 10:09:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:09:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2019-08-05 10:09:49,752 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 19 [2019-08-05 10:09:49,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:49,752 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions. [2019-08-05 10:09:49,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:09:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2019-08-05 10:09:49,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:09:49,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:49,753 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 10:09:49,753 INFO L418 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:49,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:49,753 INFO L82 PathProgramCache]: Analyzing trace with hash 212255361, now seen corresponding path program 8 times [2019-08-05 10:09:49,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:49,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:09:49,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:09:49,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:49,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:49,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:49,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:49,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:49,973 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand 7 states. [2019-08-05 10:09:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:50,109 INFO L93 Difference]: Finished difference Result 155 states and 241 transitions. [2019-08-05 10:09:50,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:09:50,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-08-05 10:09:50,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:50,111 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:09:50,111 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:09:50,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:09:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:09:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 124. [2019-08-05 10:09:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:09:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 198 transitions. [2019-08-05 10:09:50,115 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 198 transitions. Word has length 22 [2019-08-05 10:09:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:50,115 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 198 transitions. [2019-08-05 10:09:50,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 198 transitions. [2019-08-05 10:09:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:09:50,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:50,116 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2019-08-05 10:09:50,116 INFO L418 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:50,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:50,116 INFO L82 PathProgramCache]: Analyzing trace with hash 454456195, now seen corresponding path program 1 times [2019-08-05 10:09:50,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:50,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:09:50,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:50,323 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:09:50,499 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:09:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:51,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:51,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:09:51,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:09:51,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:09:51,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=106, Unknown=3, NotChecked=0, Total=132 [2019-08-05 10:09:51,631 INFO L87 Difference]: Start difference. First operand 124 states and 198 transitions. Second operand 12 states. [2019-08-05 10:09:54,663 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-08-05 10:09:58,324 WARN L188 SmtUtils]: Spent 613.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-08-05 10:10:01,715 WARN L188 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-08-05 10:10:02,386 WARN L188 SmtUtils]: Spent 650.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-08-05 10:10:04,419 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-08-05 10:10:05,239 WARN L188 SmtUtils]: Spent 770.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-08-05 10:10:07,065 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-08-05 10:10:08,515 WARN L188 SmtUtils]: Spent 688.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-08-05 10:10:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:08,662 INFO L93 Difference]: Finished difference Result 198 states and 330 transitions. [2019-08-05 10:10:08,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:10:08,662 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-08-05 10:10:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:08,663 INFO L225 Difference]: With dead ends: 198 [2019-08-05 10:10:08,663 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:10:08,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=196, Invalid=442, Unknown=12, NotChecked=0, Total=650 [2019-08-05 10:10:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:10:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:10:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:10:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:10:08,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-08-05 10:10:08,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:08,664 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:10:08,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:10:08,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:10:08,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:10:08,670 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:10:08 BoogieIcfgContainer [2019-08-05 10:10:08,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:10:08,672 INFO L168 Benchmark]: Toolchain (without parser) took 63868.89 ms. Allocated memory was 134.2 MB in the beginning and 387.4 MB in the end (delta: 253.2 MB). Free memory was 110.4 MB in the beginning and 220.9 MB in the end (delta: -110.5 MB). Peak memory consumption was 142.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:10:08,673 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 134.2 MB. Free memory is still 111.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:10:08,673 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.81 ms. Allocated memory is still 134.2 MB. Free memory was 110.0 MB in the beginning and 108.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:10:08,674 INFO L168 Benchmark]: Boogie Preprocessor took 25.08 ms. Allocated memory is still 134.2 MB. Free memory was 108.3 MB in the beginning and 107.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:10:08,674 INFO L168 Benchmark]: RCFGBuilder took 499.62 ms. Allocated memory is still 134.2 MB. Free memory was 107.0 MB in the beginning and 95.5 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:10:08,675 INFO L168 Benchmark]: TraceAbstraction took 63303.06 ms. Allocated memory was 134.2 MB in the beginning and 387.4 MB in the end (delta: 253.2 MB). Free memory was 95.0 MB in the beginning and 220.9 MB in the end (delta: -125.9 MB). Peak memory consumption was 127.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:10:08,678 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.24 ms. Allocated memory is still 134.2 MB. Free memory is still 111.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.81 ms. Allocated memory is still 134.2 MB. Free memory was 110.0 MB in the beginning and 108.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.08 ms. Allocated memory is still 134.2 MB. Free memory was 108.3 MB in the beginning and 107.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 499.62 ms. Allocated memory is still 134.2 MB. Free memory was 107.0 MB in the beginning and 95.5 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63303.06 ms. Allocated memory was 134.2 MB in the beginning and 387.4 MB in the end (delta: 253.2 MB). Free memory was 95.0 MB in the beginning and 220.9 MB in the end (delta: -125.9 MB). Peak memory consumption was 127.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 78]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 58]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 69]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 4 error locations. SAFE Result, 63.2s OverallTime, 50 OverallIterations, 3 TraceHistogramMax, 53.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1644 SDtfs, 3959 SDslu, 3335 SDs, 0 SdLazy, 16182 SolverSat, 1216 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 27.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1007 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 723 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 30.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=412occurred in iteration=20, 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, 50 MinimizatonAttempts, 3313 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 639 NumberOfCodeBlocks, 639 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 589 ConstructedInterpolants, 95 QuantifiedInterpolants, 61429 SizeOfPredicates, 175 NumberOfNonLiveVariables, 2106 ConjunctsInSsa, 399 ConjunctsInUnsatCore, 50 InterpolantComputations, 4 PerfectInterpolantSequences, 29/369 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...