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_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:10:52,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:10:52,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:10:52,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:10:52,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:10:52,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:10:52,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:10:52,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:10:52,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:10:52,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:10:52,123 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:10:52,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:10:52,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:10:52,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:10:52,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:10:52,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:10:52,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:10:52,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:10:52,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:10:52,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:10:52,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:10:52,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:10:52,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:10:52,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:10:52,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:10:52,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:10:52,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:10:52,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:10:52,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:10:52,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:10:52,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:10:52,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:10:52,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:10:52,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:10:52,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:10:52,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:10:52,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:10:52,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:10:52,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:10:52,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:10:52,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:10:52,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:10:52,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:10:52,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:10:52,237 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:10:52,237 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:10:52,238 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2019-08-05 10:10:52,238 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2019-08-05 10:10:52,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:10:52,315 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:10:52,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:10:52,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:10:52,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:10:52,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:52" (1/1) ... [2019-08-05 10:10:52,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:52" (1/1) ... [2019-08-05 10:10:52,356 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:10:52,357 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:10:52,357 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:10:52,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:10:52,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:10:52,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:10:52,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:10:52,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:52" (1/1) ... [2019-08-05 10:10:52,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:52" (1/1) ... [2019-08-05 10:10:52,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:52" (1/1) ... [2019-08-05 10:10:52,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:52" (1/1) ... [2019-08-05 10:10:52,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:52" (1/1) ... [2019-08-05 10:10:52,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:52" (1/1) ... [2019-08-05 10:10:52,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:52" (1/1) ... [2019-08-05 10:10:52,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:10:52,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:10:52,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:10:52,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:10:52,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:52" (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:10:52,501 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2019-08-05 10:10:52,501 INFO L130 BoogieDeclarations]: Found specification of procedure product [2019-08-05 10:10:52,501 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2019-08-05 10:10:53,579 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint productFINAL: assume true; [2019-08-05 10:10:53,805 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:10:53,805 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:10:53,807 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:10:53 BoogieIcfgContainer [2019-08-05 10:10:53,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:10:53,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:10:53,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:10:53,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:10:53,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:52" (1/2) ... [2019-08-05 10:10:53,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1210db46 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:10:53, skipping insertion in model container [2019-08-05 10:10:53,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:10:53" (2/2) ... [2019-08-05 10:10:53,815 INFO L109 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2019-08-05 10:10:53,838 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:10:53,846 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2019-08-05 10:10:53,862 INFO L252 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2019-08-05 10:10:53,888 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:10:53,888 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:10:53,889 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:10:53,889 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:10:53,889 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:10:53,889 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:10:53,889 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:10:53,890 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:10:53,890 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:10:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2019-08-05 10:10:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:10:53,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:53,915 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:10:53,918 INFO L418 AbstractCegarLoop]: === Iteration 1 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:53,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:53,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1483933, now seen corresponding path program 1 times [2019-08-05 10:10:53,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:54,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:10:54,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:54,271 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:10:54,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:54,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:54,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:54,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:54,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:54,295 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2019-08-05 10:10:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:55,513 INFO L93 Difference]: Finished difference Result 79 states and 240 transitions. [2019-08-05 10:10:55,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:10:55,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:10:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:55,532 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:10:55,533 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:10:55,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:10:55,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:10:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2019-08-05 10:10:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:10:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 188 transitions. [2019-08-05 10:10:55,588 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 188 transitions. Word has length 4 [2019-08-05 10:10:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:55,592 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 188 transitions. [2019-08-05 10:10:55,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 188 transitions. [2019-08-05 10:10:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:10:55,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:55,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:10:55,595 INFO L418 AbstractCegarLoop]: === Iteration 2 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:55,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1486926, now seen corresponding path program 1 times [2019-08-05 10:10:55,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:55,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:10:55,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:55,760 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:10:55,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:55,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:55,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:55,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:55,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:55,764 INFO L87 Difference]: Start difference. First operand 67 states and 188 transitions. Second operand 5 states. [2019-08-05 10:10:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:56,865 INFO L93 Difference]: Finished difference Result 91 states and 292 transitions. [2019-08-05 10:10:56,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:10:56,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:10:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:56,872 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:10:56,872 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:10:56,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:10:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:10:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-08-05 10:10:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:10:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 276 transitions. [2019-08-05 10:10:56,903 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 276 transitions. Word has length 4 [2019-08-05 10:10:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:56,903 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 276 transitions. [2019-08-05 10:10:56,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 276 transitions. [2019-08-05 10:10:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:10:56,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:56,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:10:56,906 INFO L418 AbstractCegarLoop]: === Iteration 3 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:56,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:56,907 INFO L82 PathProgramCache]: Analyzing trace with hash 951145, now seen corresponding path program 1 times [2019-08-05 10:10:56,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:56,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:10:56,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:57,119 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:10:57,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:57,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:57,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:57,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:57,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:57,122 INFO L87 Difference]: Start difference. First operand 87 states and 276 transitions. Second operand 5 states. [2019-08-05 10:10:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:57,835 INFO L93 Difference]: Finished difference Result 103 states and 344 transitions. [2019-08-05 10:10:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:10:57,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:10:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:57,840 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:10:57,840 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:10:57,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:10:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:10:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-08-05 10:10:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:10:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 328 transitions. [2019-08-05 10:10:57,854 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 328 transitions. Word has length 4 [2019-08-05 10:10:57,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:57,854 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 328 transitions. [2019-08-05 10:10:57,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 328 transitions. [2019-08-05 10:10:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:10:57,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:57,855 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:10:57,856 INFO L418 AbstractCegarLoop]: === Iteration 4 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:57,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:57,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1424687860, now seen corresponding path program 1 times [2019-08-05 10:10:57,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:57,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:10:57,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:57,999 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:10:57,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:57,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:10:58,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:10:58,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:10:58,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:10:58,001 INFO L87 Difference]: Start difference. First operand 99 states and 328 transitions. Second operand 7 states. [2019-08-05 10:11:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:00,662 INFO L93 Difference]: Finished difference Result 367 states and 1302 transitions. [2019-08-05 10:11:00,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:11:00,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:00,671 INFO L225 Difference]: With dead ends: 367 [2019-08-05 10:11:00,671 INFO L226 Difference]: Without dead ends: 367 [2019-08-05 10:11:00,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:11:00,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-08-05 10:11:00,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 177. [2019-08-05 10:11:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-05 10:11:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 711 transitions. [2019-08-05 10:11:00,696 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 711 transitions. Word has length 6 [2019-08-05 10:11:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:00,696 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 711 transitions. [2019-08-05 10:11:00,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 711 transitions. [2019-08-05 10:11:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:00,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:00,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:00,699 INFO L418 AbstractCegarLoop]: === Iteration 5 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:00,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:00,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1424690216, now seen corresponding path program 1 times [2019-08-05 10:11:00,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:00,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:11:00,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:00,855 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:11:00,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:00,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:00,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:00,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:00,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:00,857 INFO L87 Difference]: Start difference. First operand 177 states and 711 transitions. Second operand 7 states. [2019-08-05 10:11:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:02,967 INFO L93 Difference]: Finished difference Result 351 states and 1288 transitions. [2019-08-05 10:11:02,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:11:02,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:02,974 INFO L225 Difference]: With dead ends: 351 [2019-08-05 10:11:02,975 INFO L226 Difference]: Without dead ends: 351 [2019-08-05 10:11:02,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:11:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-08-05 10:11:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 177. [2019-08-05 10:11:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-05 10:11:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 709 transitions. [2019-08-05 10:11:02,993 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 709 transitions. Word has length 6 [2019-08-05 10:11:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:02,994 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 709 transitions. [2019-08-05 10:11:02,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 709 transitions. [2019-08-05 10:11:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:02,995 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:02,995 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:02,996 INFO L418 AbstractCegarLoop]: === Iteration 6 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:02,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:02,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1425662275, now seen corresponding path program 1 times [2019-08-05 10:11:02,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:03,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:11:03,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:03,123 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:11:03,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:03,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:03,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:03,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:03,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:03,125 INFO L87 Difference]: Start difference. First operand 177 states and 709 transitions. Second operand 7 states. [2019-08-05 10:11:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:04,338 INFO L93 Difference]: Finished difference Result 283 states and 1095 transitions. [2019-08-05 10:11:04,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:11:04,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:04,343 INFO L225 Difference]: With dead ends: 283 [2019-08-05 10:11:04,343 INFO L226 Difference]: Without dead ends: 283 [2019-08-05 10:11:04,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:11:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-08-05 10:11:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 208. [2019-08-05 10:11:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 10:11:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 868 transitions. [2019-08-05 10:11:04,358 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 868 transitions. Word has length 6 [2019-08-05 10:11:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:04,358 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 868 transitions. [2019-08-05 10:11:04,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 868 transitions. [2019-08-05 10:11:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:04,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:04,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:04,361 INFO L418 AbstractCegarLoop]: === Iteration 7 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:04,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1425662278, now seen corresponding path program 1 times [2019-08-05 10:11:04,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:04,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:11:04,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:04,510 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:11:04,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:04,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:04,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:04,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:04,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:04,512 INFO L87 Difference]: Start difference. First operand 208 states and 868 transitions. Second operand 7 states. [2019-08-05 10:11:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:06,378 INFO L93 Difference]: Finished difference Result 277 states and 1089 transitions. [2019-08-05 10:11:06,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:11:06,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:06,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:06,382 INFO L225 Difference]: With dead ends: 277 [2019-08-05 10:11:06,382 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 10:11:06,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:11:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 10:11:06,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 212. [2019-08-05 10:11:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 10:11:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 882 transitions. [2019-08-05 10:11:06,403 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 882 transitions. Word has length 6 [2019-08-05 10:11:06,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:06,409 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 882 transitions. [2019-08-05 10:11:06,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 882 transitions. [2019-08-05 10:11:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:06,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:06,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:06,416 INFO L418 AbstractCegarLoop]: === Iteration 8 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1426082271, now seen corresponding path program 1 times [2019-08-05 10:11:06,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:06,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:11:06,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:07,219 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:11:07,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:07,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:07,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:07,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:07,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:07,222 INFO L87 Difference]: Start difference. First operand 212 states and 882 transitions. Second operand 7 states. [2019-08-05 10:11:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:10,540 INFO L93 Difference]: Finished difference Result 432 states and 1712 transitions. [2019-08-05 10:11:10,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:11:10,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:10,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:10,546 INFO L225 Difference]: With dead ends: 432 [2019-08-05 10:11:10,546 INFO L226 Difference]: Without dead ends: 432 [2019-08-05 10:11:10,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:11:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-08-05 10:11:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 239. [2019-08-05 10:11:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-08-05 10:11:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 1021 transitions. [2019-08-05 10:11:10,558 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 1021 transitions. Word has length 6 [2019-08-05 10:11:10,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:10,558 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 1021 transitions. [2019-08-05 10:11:10,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 1021 transitions. [2019-08-05 10:11:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:10,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:10,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:10,561 INFO L418 AbstractCegarLoop]: === Iteration 9 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:10,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:10,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1411063228, now seen corresponding path program 1 times [2019-08-05 10:11:10,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:10,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:11:10,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:10,674 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:11:10,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:10,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:10,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:10,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:10,677 INFO L87 Difference]: Start difference. First operand 239 states and 1021 transitions. Second operand 7 states. [2019-08-05 10:11:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:12,075 INFO L93 Difference]: Finished difference Result 424 states and 1719 transitions. [2019-08-05 10:11:12,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:11:12,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:12,081 INFO L225 Difference]: With dead ends: 424 [2019-08-05 10:11:12,082 INFO L226 Difference]: Without dead ends: 424 [2019-08-05 10:11:12,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:11:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-08-05 10:11:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 276. [2019-08-05 10:11:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-08-05 10:11:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1210 transitions. [2019-08-05 10:11:12,093 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1210 transitions. Word has length 6 [2019-08-05 10:11:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:12,094 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 1210 transitions. [2019-08-05 10:11:12,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1210 transitions. [2019-08-05 10:11:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:12,095 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:12,095 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:12,096 INFO L418 AbstractCegarLoop]: === Iteration 10 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:12,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1411063231, now seen corresponding path program 1 times [2019-08-05 10:11:12,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:12,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:11:12,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:12,232 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:11:12,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:12,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:12,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:12,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:12,234 INFO L87 Difference]: Start difference. First operand 276 states and 1210 transitions. Second operand 7 states. [2019-08-05 10:11:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:13,615 INFO L93 Difference]: Finished difference Result 418 states and 1711 transitions. [2019-08-05 10:11:13,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:11:13,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:13,621 INFO L225 Difference]: With dead ends: 418 [2019-08-05 10:11:13,621 INFO L226 Difference]: Without dead ends: 418 [2019-08-05 10:11:13,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:11:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-08-05 10:11:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 290. [2019-08-05 10:11:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-08-05 10:11:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 1279 transitions. [2019-08-05 10:11:13,634 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 1279 transitions. Word has length 6 [2019-08-05 10:11:13,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:13,634 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 1279 transitions. [2019-08-05 10:11:13,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 1279 transitions. [2019-08-05 10:11:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:13,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:13,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:13,636 INFO L418 AbstractCegarLoop]: === Iteration 11 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:13,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:13,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1411050270, now seen corresponding path program 1 times [2019-08-05 10:11:13,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:13,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:11:13,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:13,767 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:11:13,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:13,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:13,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:13,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:13,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:13,769 INFO L87 Difference]: Start difference. First operand 290 states and 1279 transitions. Second operand 7 states. [2019-08-05 10:11:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:15,290 INFO L93 Difference]: Finished difference Result 473 states and 1955 transitions. [2019-08-05 10:11:15,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:11:15,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:15,296 INFO L225 Difference]: With dead ends: 473 [2019-08-05 10:11:15,296 INFO L226 Difference]: Without dead ends: 473 [2019-08-05 10:11:15,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:11:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-08-05 10:11:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 273. [2019-08-05 10:11:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-08-05 10:11:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1191 transitions. [2019-08-05 10:11:15,308 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1191 transitions. Word has length 6 [2019-08-05 10:11:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:15,308 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 1191 transitions. [2019-08-05 10:11:15,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1191 transitions. [2019-08-05 10:11:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:15,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:15,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:15,310 INFO L418 AbstractCegarLoop]: === Iteration 12 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:15,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:15,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1411050273, now seen corresponding path program 1 times [2019-08-05 10:11:15,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:15,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:11:15,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:15,541 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:11:15,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:15,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:15,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:15,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:15,544 INFO L87 Difference]: Start difference. First operand 273 states and 1191 transitions. Second operand 7 states. [2019-08-05 10:11:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:17,143 INFO L93 Difference]: Finished difference Result 467 states and 1945 transitions. [2019-08-05 10:11:17,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:11:17,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:17,148 INFO L225 Difference]: With dead ends: 467 [2019-08-05 10:11:17,149 INFO L226 Difference]: Without dead ends: 467 [2019-08-05 10:11:17,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:11:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-08-05 10:11:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 254. [2019-08-05 10:11:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-08-05 10:11:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1101 transitions. [2019-08-05 10:11:17,159 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1101 transitions. Word has length 6 [2019-08-05 10:11:17,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:17,159 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 1101 transitions. [2019-08-05 10:11:17,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1101 transitions. [2019-08-05 10:11:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:17,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:17,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:17,161 INFO L418 AbstractCegarLoop]: === Iteration 13 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:17,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1418574259, now seen corresponding path program 1 times [2019-08-05 10:11:17,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:17,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:11:17,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:17,751 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:11:17,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:17,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:17,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:17,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:17,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:17,752 INFO L87 Difference]: Start difference. First operand 254 states and 1101 transitions. Second operand 7 states. [2019-08-05 10:11:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:19,378 INFO L93 Difference]: Finished difference Result 561 states and 2327 transitions. [2019-08-05 10:11:19,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:11:19,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:19,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:19,385 INFO L225 Difference]: With dead ends: 561 [2019-08-05 10:11:19,385 INFO L226 Difference]: Without dead ends: 561 [2019-08-05 10:11:19,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:11:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-08-05 10:11:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 393. [2019-08-05 10:11:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-08-05 10:11:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1780 transitions. [2019-08-05 10:11:19,399 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1780 transitions. Word has length 6 [2019-08-05 10:11:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:19,399 INFO L475 AbstractCegarLoop]: Abstraction has 393 states and 1780 transitions. [2019-08-05 10:11:19,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1780 transitions. [2019-08-05 10:11:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:19,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:19,401 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:19,401 INFO L418 AbstractCegarLoop]: === Iteration 14 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:19,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:19,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1418562851, now seen corresponding path program 1 times [2019-08-05 10:11:19,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:19,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:11:19,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:19,533 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:11:19,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:19,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:19,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:19,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:19,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:19,535 INFO L87 Difference]: Start difference. First operand 393 states and 1780 transitions. Second operand 7 states. [2019-08-05 10:11:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:20,910 INFO L93 Difference]: Finished difference Result 557 states and 2373 transitions. [2019-08-05 10:11:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:11:20,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:20,917 INFO L225 Difference]: With dead ends: 557 [2019-08-05 10:11:20,917 INFO L226 Difference]: Without dead ends: 557 [2019-08-05 10:11:20,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:11:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-08-05 10:11:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 402. [2019-08-05 10:11:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-08-05 10:11:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1826 transitions. [2019-08-05 10:11:20,931 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1826 transitions. Word has length 6 [2019-08-05 10:11:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:20,931 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 1826 transitions. [2019-08-05 10:11:20,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1826 transitions. [2019-08-05 10:11:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:20,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:20,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:20,933 INFO L418 AbstractCegarLoop]: === Iteration 15 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:20,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:20,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1428797377, now seen corresponding path program 1 times [2019-08-05 10:11:20,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:20,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:11:20,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:21,125 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:11:21,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:21,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:21,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:21,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:21,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:21,127 INFO L87 Difference]: Start difference. First operand 402 states and 1826 transitions. Second operand 7 states. [2019-08-05 10:11:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:22,203 INFO L93 Difference]: Finished difference Result 482 states and 2100 transitions. [2019-08-05 10:11:22,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:11:22,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:22,210 INFO L225 Difference]: With dead ends: 482 [2019-08-05 10:11:22,210 INFO L226 Difference]: Without dead ends: 482 [2019-08-05 10:11:22,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:11:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-08-05 10:11:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 380. [2019-08-05 10:11:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-08-05 10:11:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1711 transitions. [2019-08-05 10:11:22,221 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1711 transitions. Word has length 6 [2019-08-05 10:11:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:22,222 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 1711 transitions. [2019-08-05 10:11:22,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1711 transitions. [2019-08-05 10:11:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:22,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:22,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:22,224 INFO L418 AbstractCegarLoop]: === Iteration 16 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:22,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:22,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1428952251, now seen corresponding path program 1 times [2019-08-05 10:11:22,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:22,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:11:22,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:22,476 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:11:22,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:22,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:22,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:22,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:22,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:22,479 INFO L87 Difference]: Start difference. First operand 380 states and 1711 transitions. Second operand 7 states. [2019-08-05 10:11:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:23,714 INFO L93 Difference]: Finished difference Result 552 states and 2407 transitions. [2019-08-05 10:11:23,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:11:23,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:23,720 INFO L225 Difference]: With dead ends: 552 [2019-08-05 10:11:23,720 INFO L226 Difference]: Without dead ends: 552 [2019-08-05 10:11:23,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:11:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-08-05 10:11:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 441. [2019-08-05 10:11:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-08-05 10:11:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 2015 transitions. [2019-08-05 10:11:23,734 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 2015 transitions. Word has length 6 [2019-08-05 10:11:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:23,735 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 2015 transitions. [2019-08-05 10:11:23,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 2015 transitions. [2019-08-05 10:11:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:23,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:23,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:23,737 INFO L418 AbstractCegarLoop]: === Iteration 17 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:23,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:23,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1428952254, now seen corresponding path program 1 times [2019-08-05 10:11:23,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:23,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:11:23,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:23,899 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:11:23,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:23,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:23,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:23,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:23,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:23,901 INFO L87 Difference]: Start difference. First operand 441 states and 2015 transitions. Second operand 7 states. [2019-08-05 10:11:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:25,050 INFO L93 Difference]: Finished difference Result 546 states and 2391 transitions. [2019-08-05 10:11:25,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:11:25,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:25,056 INFO L225 Difference]: With dead ends: 546 [2019-08-05 10:11:25,057 INFO L226 Difference]: Without dead ends: 546 [2019-08-05 10:11:25,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:11:25,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-08-05 10:11:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 449. [2019-08-05 10:11:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-08-05 10:11:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 2039 transitions. [2019-08-05 10:11:25,070 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 2039 transitions. Word has length 6 [2019-08-05 10:11:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:25,070 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 2039 transitions. [2019-08-05 10:11:25,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 2039 transitions. [2019-08-05 10:11:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:25,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:25,071 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:25,072 INFO L418 AbstractCegarLoop]: === Iteration 18 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:25,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:25,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1418670078, now seen corresponding path program 1 times [2019-08-05 10:11:25,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:25,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:11:25,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:25,173 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:11:25,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:25,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:25,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:25,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:25,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:25,176 INFO L87 Difference]: Start difference. First operand 449 states and 2039 transitions. Second operand 7 states. [2019-08-05 10:11:25,573 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:11:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:27,039 INFO L93 Difference]: Finished difference Result 913 states and 3961 transitions. [2019-08-05 10:11:27,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:11:27,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:27,047 INFO L225 Difference]: With dead ends: 913 [2019-08-05 10:11:27,047 INFO L226 Difference]: Without dead ends: 913 [2019-08-05 10:11:27,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:11:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-08-05 10:11:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 512. [2019-08-05 10:11:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-08-05 10:11:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 2354 transitions. [2019-08-05 10:11:27,065 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 2354 transitions. Word has length 6 [2019-08-05 10:11:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:27,065 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 2354 transitions. [2019-08-05 10:11:27,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 2354 transitions. [2019-08-05 10:11:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:27,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:27,066 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:27,067 INFO L418 AbstractCegarLoop]: === Iteration 19 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:27,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1418670081, now seen corresponding path program 1 times [2019-08-05 10:11:27,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:27,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:11:27,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:27,204 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:11:27,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:27,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:27,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:27,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:27,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:27,206 INFO L87 Difference]: Start difference. First operand 512 states and 2354 transitions. Second operand 7 states. [2019-08-05 10:11:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:28,862 INFO L93 Difference]: Finished difference Result 907 states and 3941 transitions. [2019-08-05 10:11:28,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:11:28,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:28,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:28,872 INFO L225 Difference]: With dead ends: 907 [2019-08-05 10:11:28,872 INFO L226 Difference]: Without dead ends: 907 [2019-08-05 10:11:28,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:11:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-08-05 10:11:28,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 531. [2019-08-05 10:11:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-08-05 10:11:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 2443 transitions. [2019-08-05 10:11:28,890 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 2443 transitions. Word has length 6 [2019-08-05 10:11:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:28,891 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 2443 transitions. [2019-08-05 10:11:28,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 2443 transitions. [2019-08-05 10:11:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:28,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:28,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:28,893 INFO L418 AbstractCegarLoop]: === Iteration 20 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:28,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:28,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1418672434, now seen corresponding path program 1 times [2019-08-05 10:11:28,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:28,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:11:28,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:29,075 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:11:29,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:29,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:29,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:29,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:29,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:29,078 INFO L87 Difference]: Start difference. First operand 531 states and 2443 transitions. Second operand 7 states. [2019-08-05 10:11:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:30,976 INFO L93 Difference]: Finished difference Result 988 states and 4287 transitions. [2019-08-05 10:11:30,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:11:30,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:30,984 INFO L225 Difference]: With dead ends: 988 [2019-08-05 10:11:30,984 INFO L226 Difference]: Without dead ends: 988 [2019-08-05 10:11:30,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:11:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-08-05 10:11:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 538. [2019-08-05 10:11:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-08-05 10:11:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 2483 transitions. [2019-08-05 10:11:31,003 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 2483 transitions. Word has length 6 [2019-08-05 10:11:31,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:31,003 INFO L475 AbstractCegarLoop]: Abstraction has 538 states and 2483 transitions. [2019-08-05 10:11:31,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 2483 transitions. [2019-08-05 10:11:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:31,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:31,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:31,005 INFO L418 AbstractCegarLoop]: === Iteration 21 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:31,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:31,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1418672437, now seen corresponding path program 1 times [2019-08-05 10:11:31,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:31,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:11:31,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:31,118 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:11:31,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:31,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:31,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:31,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:31,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:31,121 INFO L87 Difference]: Start difference. First operand 538 states and 2483 transitions. Second operand 7 states. [2019-08-05 10:11:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:33,001 INFO L93 Difference]: Finished difference Result 982 states and 4267 transitions. [2019-08-05 10:11:33,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:11:33,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:33,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:33,011 INFO L225 Difference]: With dead ends: 982 [2019-08-05 10:11:33,011 INFO L226 Difference]: Without dead ends: 982 [2019-08-05 10:11:33,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:11:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-08-05 10:11:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 511. [2019-08-05 10:11:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-08-05 10:11:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 2359 transitions. [2019-08-05 10:11:33,031 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 2359 transitions. Word has length 6 [2019-08-05 10:11:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:33,031 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 2359 transitions. [2019-08-05 10:11:33,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 2359 transitions. [2019-08-05 10:11:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:33,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:33,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:33,033 INFO L418 AbstractCegarLoop]: === Iteration 22 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:33,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash 914033883, now seen corresponding path program 1 times [2019-08-05 10:11:33,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:33,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:11:33,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:33,224 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:11:33,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:33,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:33,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:33,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:33,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:33,225 INFO L87 Difference]: Start difference. First operand 511 states and 2359 transitions. Second operand 7 states. [2019-08-05 10:11:34,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:34,715 INFO L93 Difference]: Finished difference Result 658 states and 2900 transitions. [2019-08-05 10:11:34,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:11:34,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:34,725 INFO L225 Difference]: With dead ends: 658 [2019-08-05 10:11:34,725 INFO L226 Difference]: Without dead ends: 658 [2019-08-05 10:11:34,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:11:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-08-05 10:11:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 519. [2019-08-05 10:11:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-08-05 10:11:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 2393 transitions. [2019-08-05 10:11:34,738 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 2393 transitions. Word has length 6 [2019-08-05 10:11:34,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:34,738 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 2393 transitions. [2019-08-05 10:11:34,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 2393 transitions. [2019-08-05 10:11:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:34,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:34,739 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:34,739 INFO L418 AbstractCegarLoop]: === Iteration 23 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:34,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:34,739 INFO L82 PathProgramCache]: Analyzing trace with hash 914033756, now seen corresponding path program 1 times [2019-08-05 10:11:34,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:34,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:11:34,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:34,854 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:11:34,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:34,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:34,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:34,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:34,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:34,857 INFO L87 Difference]: Start difference. First operand 519 states and 2393 transitions. Second operand 7 states. [2019-08-05 10:11:36,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:36,250 INFO L93 Difference]: Finished difference Result 652 states and 2894 transitions. [2019-08-05 10:11:36,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:11:36,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:36,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:36,258 INFO L225 Difference]: With dead ends: 652 [2019-08-05 10:11:36,258 INFO L226 Difference]: Without dead ends: 652 [2019-08-05 10:11:36,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:11:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-08-05 10:11:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 506. [2019-08-05 10:11:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-08-05 10:11:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 2323 transitions. [2019-08-05 10:11:36,271 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 2323 transitions. Word has length 6 [2019-08-05 10:11:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:36,272 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 2323 transitions. [2019-08-05 10:11:36,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 2323 transitions. [2019-08-05 10:11:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:36,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:36,273 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:36,273 INFO L418 AbstractCegarLoop]: === Iteration 24 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:36,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:36,274 INFO L82 PathProgramCache]: Analyzing trace with hash 914022475, now seen corresponding path program 1 times [2019-08-05 10:11:36,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:36,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:11:36,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:36,391 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:11:36,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:36,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:36,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:36,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:36,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:36,393 INFO L87 Difference]: Start difference. First operand 506 states and 2323 transitions. Second operand 7 states. [2019-08-05 10:11:37,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:37,994 INFO L93 Difference]: Finished difference Result 710 states and 3108 transitions. [2019-08-05 10:11:37,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:11:37,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:38,001 INFO L225 Difference]: With dead ends: 710 [2019-08-05 10:11:38,002 INFO L226 Difference]: Without dead ends: 710 [2019-08-05 10:11:38,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:11:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-08-05 10:11:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 516. [2019-08-05 10:11:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-08-05 10:11:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 2378 transitions. [2019-08-05 10:11:38,016 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 2378 transitions. Word has length 6 [2019-08-05 10:11:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:38,017 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 2378 transitions. [2019-08-05 10:11:38,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 2378 transitions. [2019-08-05 10:11:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:38,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:38,018 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:38,018 INFO L418 AbstractCegarLoop]: === Iteration 25 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:38,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:38,019 INFO L82 PathProgramCache]: Analyzing trace with hash 914022348, now seen corresponding path program 1 times [2019-08-05 10:11:38,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:38,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:11:38,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:38,164 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:11:38,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:38,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:38,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:38,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:38,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:38,166 INFO L87 Difference]: Start difference. First operand 516 states and 2378 transitions. Second operand 7 states. [2019-08-05 10:11:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:39,903 INFO L93 Difference]: Finished difference Result 700 states and 3098 transitions. [2019-08-05 10:11:39,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:11:39,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:39,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:39,908 INFO L225 Difference]: With dead ends: 700 [2019-08-05 10:11:39,909 INFO L226 Difference]: Without dead ends: 700 [2019-08-05 10:11:39,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:11:39,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-08-05 10:11:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 474. [2019-08-05 10:11:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-08-05 10:11:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 2158 transitions. [2019-08-05 10:11:39,918 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 2158 transitions. Word has length 6 [2019-08-05 10:11:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:39,919 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 2158 transitions. [2019-08-05 10:11:39,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 2158 transitions. [2019-08-05 10:11:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:39,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:39,919 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:39,920 INFO L418 AbstractCegarLoop]: === Iteration 26 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:39,920 INFO L82 PathProgramCache]: Analyzing trace with hash 914072468, now seen corresponding path program 1 times [2019-08-05 10:11:39,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:39,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:11:39,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:39,974 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:11:39,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:39,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:39,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:39,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:39,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:39,976 INFO L87 Difference]: Start difference. First operand 474 states and 2158 transitions. Second operand 7 states. [2019-08-05 10:11:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:41,374 INFO L93 Difference]: Finished difference Result 787 states and 3428 transitions. [2019-08-05 10:11:41,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:11:41,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:41,379 INFO L225 Difference]: With dead ends: 787 [2019-08-05 10:11:41,379 INFO L226 Difference]: Without dead ends: 787 [2019-08-05 10:11:41,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:11:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-08-05 10:11:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 614. [2019-08-05 10:11:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-08-05 10:11:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 2839 transitions. [2019-08-05 10:11:41,394 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 2839 transitions. Word has length 6 [2019-08-05 10:11:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:41,394 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 2839 transitions. [2019-08-05 10:11:41,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 2839 transitions. [2019-08-05 10:11:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:41,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:41,395 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:41,396 INFO L418 AbstractCegarLoop]: === Iteration 27 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash 914569284, now seen corresponding path program 1 times [2019-08-05 10:11:41,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:41,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:11:41,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:41,519 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:11:41,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:41,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:41,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:41,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:41,521 INFO L87 Difference]: Start difference. First operand 614 states and 2839 transitions. Second operand 7 states. [2019-08-05 10:11:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:42,969 INFO L93 Difference]: Finished difference Result 794 states and 3526 transitions. [2019-08-05 10:11:42,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:11:42,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:42,973 INFO L225 Difference]: With dead ends: 794 [2019-08-05 10:11:42,973 INFO L226 Difference]: Without dead ends: 794 [2019-08-05 10:11:42,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:11:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-08-05 10:11:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 645. [2019-08-05 10:11:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-08-05 10:11:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 2972 transitions. [2019-08-05 10:11:42,985 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 2972 transitions. Word has length 6 [2019-08-05 10:11:42,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:42,985 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 2972 transitions. [2019-08-05 10:11:42,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 2972 transitions. [2019-08-05 10:11:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:42,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:42,985 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:42,986 INFO L418 AbstractCegarLoop]: === Iteration 28 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:42,986 INFO L82 PathProgramCache]: Analyzing trace with hash 914569157, now seen corresponding path program 1 times [2019-08-05 10:11:42,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:42,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:11:42,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:43,062 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:11:43,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:43,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:43,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:43,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:43,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:43,064 INFO L87 Difference]: Start difference. First operand 645 states and 2972 transitions. Second operand 7 states. [2019-08-05 10:11:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:44,631 INFO L93 Difference]: Finished difference Result 788 states and 3520 transitions. [2019-08-05 10:11:44,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:11:44,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:44,636 INFO L225 Difference]: With dead ends: 788 [2019-08-05 10:11:44,636 INFO L226 Difference]: Without dead ends: 788 [2019-08-05 10:11:44,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:11:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-08-05 10:11:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 633. [2019-08-05 10:11:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-08-05 10:11:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 2915 transitions. [2019-08-05 10:11:44,647 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 2915 transitions. Word has length 6 [2019-08-05 10:11:44,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:44,648 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 2915 transitions. [2019-08-05 10:11:44,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 2915 transitions. [2019-08-05 10:11:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:44,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:44,648 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:44,649 INFO L418 AbstractCegarLoop]: === Iteration 29 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:44,649 INFO L82 PathProgramCache]: Analyzing trace with hash 913940811, now seen corresponding path program 1 times [2019-08-05 10:11:44,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:44,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:11:44,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:44,713 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:11:44,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:44,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:44,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:44,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:44,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:44,714 INFO L87 Difference]: Start difference. First operand 633 states and 2915 transitions. Second operand 7 states. [2019-08-05 10:11:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:46,348 INFO L93 Difference]: Finished difference Result 990 states and 4326 transitions. [2019-08-05 10:11:46,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:11:46,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:46,353 INFO L225 Difference]: With dead ends: 990 [2019-08-05 10:11:46,353 INFO L226 Difference]: Without dead ends: 990 [2019-08-05 10:11:46,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:11:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-08-05 10:11:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 645. [2019-08-05 10:11:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-08-05 10:11:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 2969 transitions. [2019-08-05 10:11:46,374 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 2969 transitions. Word has length 6 [2019-08-05 10:11:46,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:46,374 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 2969 transitions. [2019-08-05 10:11:46,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 2969 transitions. [2019-08-05 10:11:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:11:46,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:46,376 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:11:46,376 INFO L418 AbstractCegarLoop]: === Iteration 30 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:46,376 INFO L82 PathProgramCache]: Analyzing trace with hash 913927853, now seen corresponding path program 1 times [2019-08-05 10:11:46,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:46,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:11:46,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:46,544 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:11:46,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:46,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:11:46,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:46,546 INFO L87 Difference]: Start difference. First operand 645 states and 2969 transitions. Second operand 7 states. [2019-08-05 10:11:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:48,002 INFO L93 Difference]: Finished difference Result 875 states and 3862 transitions. [2019-08-05 10:11:48,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:11:48,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:11:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:48,007 INFO L225 Difference]: With dead ends: 875 [2019-08-05 10:11:48,008 INFO L226 Difference]: Without dead ends: 875 [2019-08-05 10:11:48,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:11:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-08-05 10:11:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 519. [2019-08-05 10:11:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-08-05 10:11:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 2330 transitions. [2019-08-05 10:11:48,023 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 2330 transitions. Word has length 6 [2019-08-05 10:11:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:48,024 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 2330 transitions. [2019-08-05 10:11:48,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 2330 transitions. [2019-08-05 10:11:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:11:48,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:48,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:48,025 INFO L418 AbstractCegarLoop]: === Iteration 31 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:48,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:48,025 INFO L82 PathProgramCache]: Analyzing trace with hash -969514716, now seen corresponding path program 1 times [2019-08-05 10:11:48,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:48,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:11:48,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:48,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:48,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:11:48,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:11:48,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:11:48,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:11:48,131 INFO L87 Difference]: Start difference. First operand 519 states and 2330 transitions. Second operand 4 states. [2019-08-05 10:11:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:48,229 INFO L93 Difference]: Finished difference Result 526 states and 2201 transitions. [2019-08-05 10:11:48,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:11:48,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 10:11:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:48,240 INFO L225 Difference]: With dead ends: 526 [2019-08-05 10:11:48,240 INFO L226 Difference]: Without dead ends: 526 [2019-08-05 10:11:48,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:11:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-08-05 10:11:48,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 424. [2019-08-05 10:11:48,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-08-05 10:11:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1827 transitions. [2019-08-05 10:11:48,251 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1827 transitions. Word has length 8 [2019-08-05 10:11:48,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:48,252 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 1827 transitions. [2019-08-05 10:11:48,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:11:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1827 transitions. [2019-08-05 10:11:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:11:48,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:48,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:48,261 INFO L418 AbstractCegarLoop]: === Iteration 32 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:48,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:48,261 INFO L82 PathProgramCache]: Analyzing trace with hash -969552830, now seen corresponding path program 1 times [2019-08-05 10:11:48,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:48,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:11:48,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:48,646 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:11:48,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:48,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:11:48,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:11:48,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:11:48,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:11:48,647 INFO L87 Difference]: Start difference. First operand 424 states and 1827 transitions. Second operand 8 states. [2019-08-05 10:11:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:52,246 INFO L93 Difference]: Finished difference Result 1797 states and 7084 transitions. [2019-08-05 10:11:52,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:11:52,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:11:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:52,251 INFO L225 Difference]: With dead ends: 1797 [2019-08-05 10:11:52,252 INFO L226 Difference]: Without dead ends: 1797 [2019-08-05 10:11:52,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:11:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2019-08-05 10:11:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 720. [2019-08-05 10:11:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-08-05 10:11:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 3286 transitions. [2019-08-05 10:11:52,270 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 3286 transitions. Word has length 8 [2019-08-05 10:11:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:52,270 INFO L475 AbstractCegarLoop]: Abstraction has 720 states and 3286 transitions. [2019-08-05 10:11:52,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:11:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 3286 transitions. [2019-08-05 10:11:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:11:52,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:52,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:52,272 INFO L418 AbstractCegarLoop]: === Iteration 33 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:52,272 INFO L82 PathProgramCache]: Analyzing trace with hash -969552827, now seen corresponding path program 1 times [2019-08-05 10:11:52,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:52,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:11:52,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:52,420 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:11:52,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:52,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:11:52,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:11:52,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:11:52,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:11:52,422 INFO L87 Difference]: Start difference. First operand 720 states and 3286 transitions. Second operand 8 states. [2019-08-05 10:11:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:56,336 INFO L93 Difference]: Finished difference Result 1588 states and 6186 transitions. [2019-08-05 10:11:56,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:11:56,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:11:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:56,341 INFO L225 Difference]: With dead ends: 1588 [2019-08-05 10:11:56,342 INFO L226 Difference]: Without dead ends: 1588 [2019-08-05 10:11:56,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:11:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2019-08-05 10:11:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 739. [2019-08-05 10:11:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-08-05 10:11:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 3371 transitions. [2019-08-05 10:11:56,372 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 3371 transitions. Word has length 8 [2019-08-05 10:11:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:56,372 INFO L475 AbstractCegarLoop]: Abstraction has 739 states and 3371 transitions. [2019-08-05 10:11:56,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:11:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 3371 transitions. [2019-08-05 10:11:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:11:56,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:56,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:56,374 INFO L418 AbstractCegarLoop]: === Iteration 34 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:56,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:56,374 INFO L82 PathProgramCache]: Analyzing trace with hash -969552824, now seen corresponding path program 1 times [2019-08-05 10:11:56,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:56,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:11:56,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:56,523 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:11:56,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:56,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:11:56,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:11:56,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:11:56,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:11:56,526 INFO L87 Difference]: Start difference. First operand 739 states and 3371 transitions. Second operand 8 states. [2019-08-05 10:12:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:00,349 INFO L93 Difference]: Finished difference Result 1472 states and 5788 transitions. [2019-08-05 10:12:00,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:12:00,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:00,355 INFO L225 Difference]: With dead ends: 1472 [2019-08-05 10:12:00,355 INFO L226 Difference]: Without dead ends: 1472 [2019-08-05 10:12:00,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:12:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2019-08-05 10:12:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 749. [2019-08-05 10:12:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-08-05 10:12:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 3405 transitions. [2019-08-05 10:12:00,372 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 3405 transitions. Word has length 8 [2019-08-05 10:12:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:00,373 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 3405 transitions. [2019-08-05 10:12:00,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 3405 transitions. [2019-08-05 10:12:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:00,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:00,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:00,374 INFO L418 AbstractCegarLoop]: === Iteration 35 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:00,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash -982478745, now seen corresponding path program 1 times [2019-08-05 10:12:00,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:00,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:12:00,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:00,488 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:12:00,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:00,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:00,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:00,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:00,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:00,490 INFO L87 Difference]: Start difference. First operand 749 states and 3405 transitions. Second operand 8 states. [2019-08-05 10:12:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:04,107 INFO L93 Difference]: Finished difference Result 2808 states and 11891 transitions. [2019-08-05 10:12:04,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:12:04,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:04,116 INFO L225 Difference]: With dead ends: 2808 [2019-08-05 10:12:04,116 INFO L226 Difference]: Without dead ends: 2808 [2019-08-05 10:12:04,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:12:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2019-08-05 10:12:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 1215. [2019-08-05 10:12:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-08-05 10:12:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 5662 transitions. [2019-08-05 10:12:04,149 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 5662 transitions. Word has length 8 [2019-08-05 10:12:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:04,149 INFO L475 AbstractCegarLoop]: Abstraction has 1215 states and 5662 transitions. [2019-08-05 10:12:04,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 5662 transitions. [2019-08-05 10:12:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:04,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:04,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:04,151 INFO L418 AbstractCegarLoop]: === Iteration 36 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:04,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:04,151 INFO L82 PathProgramCache]: Analyzing trace with hash -982478742, now seen corresponding path program 1 times [2019-08-05 10:12:04,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:04,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:12:04,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:04,289 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:12:04,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:04,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:04,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:04,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:04,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:04,290 INFO L87 Difference]: Start difference. First operand 1215 states and 5662 transitions. Second operand 8 states. [2019-08-05 10:12:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:07,563 INFO L93 Difference]: Finished difference Result 3593 states and 15622 transitions. [2019-08-05 10:12:07,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:12:07,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:07,573 INFO L225 Difference]: With dead ends: 3593 [2019-08-05 10:12:07,573 INFO L226 Difference]: Without dead ends: 3593 [2019-08-05 10:12:07,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:12:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2019-08-05 10:12:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 1421. [2019-08-05 10:12:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-08-05 10:12:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 6630 transitions. [2019-08-05 10:12:07,631 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 6630 transitions. Word has length 8 [2019-08-05 10:12:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:07,631 INFO L475 AbstractCegarLoop]: Abstraction has 1421 states and 6630 transitions. [2019-08-05 10:12:07,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 6630 transitions. [2019-08-05 10:12:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:07,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:07,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:07,632 INFO L418 AbstractCegarLoop]: === Iteration 37 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:07,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:07,633 INFO L82 PathProgramCache]: Analyzing trace with hash -982478739, now seen corresponding path program 1 times [2019-08-05 10:12:07,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:07,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:12:07,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:07,714 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:12:07,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:07,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:07,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:07,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:07,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:07,716 INFO L87 Difference]: Start difference. First operand 1421 states and 6630 transitions. Second operand 8 states. [2019-08-05 10:12:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:11,464 INFO L93 Difference]: Finished difference Result 3486 states and 15090 transitions. [2019-08-05 10:12:11,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:12:11,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:11,474 INFO L225 Difference]: With dead ends: 3486 [2019-08-05 10:12:11,474 INFO L226 Difference]: Without dead ends: 3486 [2019-08-05 10:12:11,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:12:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2019-08-05 10:12:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 1751. [2019-08-05 10:12:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2019-08-05 10:12:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 8202 transitions. [2019-08-05 10:12:11,531 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 8202 transitions. Word has length 8 [2019-08-05 10:12:11,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:11,531 INFO L475 AbstractCegarLoop]: Abstraction has 1751 states and 8202 transitions. [2019-08-05 10:12:11,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 8202 transitions. [2019-08-05 10:12:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:11,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:11,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:11,533 INFO L418 AbstractCegarLoop]: === Iteration 38 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:11,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:11,534 INFO L82 PathProgramCache]: Analyzing trace with hash -982470592, now seen corresponding path program 1 times [2019-08-05 10:12:11,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:11,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:12:11,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:11,802 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:12:11,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:11,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:11,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:11,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:11,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:11,804 INFO L87 Difference]: Start difference. First operand 1751 states and 8202 transitions. Second operand 8 states. [2019-08-05 10:12:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:15,772 INFO L93 Difference]: Finished difference Result 3730 states and 16030 transitions. [2019-08-05 10:12:15,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:12:15,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:15,785 INFO L225 Difference]: With dead ends: 3730 [2019-08-05 10:12:15,785 INFO L226 Difference]: Without dead ends: 3730 [2019-08-05 10:12:15,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:12:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2019-08-05 10:12:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 1888. [2019-08-05 10:12:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1888 states. [2019-08-05 10:12:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 8885 transitions. [2019-08-05 10:12:15,840 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 8885 transitions. Word has length 8 [2019-08-05 10:12:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:15,840 INFO L475 AbstractCegarLoop]: Abstraction has 1888 states and 8885 transitions. [2019-08-05 10:12:15,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 8885 transitions. [2019-08-05 10:12:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:15,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:15,841 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:15,842 INFO L418 AbstractCegarLoop]: === Iteration 39 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:15,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:15,842 INFO L82 PathProgramCache]: Analyzing trace with hash -982470589, now seen corresponding path program 1 times [2019-08-05 10:12:15,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:15,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:12:15,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:15,981 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:12:15,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:15,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:15,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:15,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:15,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:15,982 INFO L87 Difference]: Start difference. First operand 1888 states and 8885 transitions. Second operand 8 states. [2019-08-05 10:12:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:18,896 INFO L93 Difference]: Finished difference Result 3704 states and 16140 transitions. [2019-08-05 10:12:18,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:12:18,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:18,907 INFO L225 Difference]: With dead ends: 3704 [2019-08-05 10:12:18,907 INFO L226 Difference]: Without dead ends: 3704 [2019-08-05 10:12:18,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:12:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2019-08-05 10:12:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 1899. [2019-08-05 10:12:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1899 states. [2019-08-05 10:12:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 8896 transitions. [2019-08-05 10:12:18,957 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 8896 transitions. Word has length 8 [2019-08-05 10:12:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:18,957 INFO L475 AbstractCegarLoop]: Abstraction has 1899 states and 8896 transitions. [2019-08-05 10:12:18,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 8896 transitions. [2019-08-05 10:12:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:18,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:18,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:18,959 INFO L418 AbstractCegarLoop]: === Iteration 40 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:18,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:18,959 INFO L82 PathProgramCache]: Analyzing trace with hash -982470586, now seen corresponding path program 1 times [2019-08-05 10:12:18,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:18,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:12:18,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:19,041 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:12:19,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:19,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:19,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:19,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:19,043 INFO L87 Difference]: Start difference. First operand 1899 states and 8896 transitions. Second operand 8 states. [2019-08-05 10:12:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:22,993 INFO L93 Difference]: Finished difference Result 3626 states and 15689 transitions. [2019-08-05 10:12:22,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:12:22,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:22,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:23,002 INFO L225 Difference]: With dead ends: 3626 [2019-08-05 10:12:23,003 INFO L226 Difference]: Without dead ends: 3626 [2019-08-05 10:12:23,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:12:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-08-05 10:12:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 1836. [2019-08-05 10:12:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2019-08-05 10:12:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 8604 transitions. [2019-08-05 10:12:23,041 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 8604 transitions. Word has length 8 [2019-08-05 10:12:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:23,041 INFO L475 AbstractCegarLoop]: Abstraction has 1836 states and 8604 transitions. [2019-08-05 10:12:23,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 8604 transitions. [2019-08-05 10:12:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:23,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:23,042 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:23,042 INFO L418 AbstractCegarLoop]: === Iteration 41 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:23,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash -967288714, now seen corresponding path program 1 times [2019-08-05 10:12:23,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:23,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:12:23,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:23,496 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:12:23,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:23,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:23,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:23,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:23,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:23,497 INFO L87 Difference]: Start difference. First operand 1836 states and 8604 transitions. Second operand 8 states. [2019-08-05 10:12:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:27,048 INFO L93 Difference]: Finished difference Result 7378 states and 32512 transitions. [2019-08-05 10:12:27,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:12:27,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:27,068 INFO L225 Difference]: With dead ends: 7378 [2019-08-05 10:12:27,069 INFO L226 Difference]: Without dead ends: 7378 [2019-08-05 10:12:27,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:12:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7378 states. [2019-08-05 10:12:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7378 to 4061. [2019-08-05 10:12:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4061 states. [2019-08-05 10:12:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 19099 transitions. [2019-08-05 10:12:27,261 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 19099 transitions. Word has length 8 [2019-08-05 10:12:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:27,262 INFO L475 AbstractCegarLoop]: Abstraction has 4061 states and 19099 transitions. [2019-08-05 10:12:27,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 19099 transitions. [2019-08-05 10:12:27,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:27,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:27,265 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:27,266 INFO L418 AbstractCegarLoop]: === Iteration 42 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:27,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:27,266 INFO L82 PathProgramCache]: Analyzing trace with hash -967288711, now seen corresponding path program 1 times [2019-08-05 10:12:27,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:27,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:12:27,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:27,452 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:12:27,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:27,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:27,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:27,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:27,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:27,454 INFO L87 Difference]: Start difference. First operand 4061 states and 19099 transitions. Second operand 8 states. [2019-08-05 10:12:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:30,605 INFO L93 Difference]: Finished difference Result 6074 states and 27332 transitions. [2019-08-05 10:12:30,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:12:30,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:30,622 INFO L225 Difference]: With dead ends: 6074 [2019-08-05 10:12:30,622 INFO L226 Difference]: Without dead ends: 6074 [2019-08-05 10:12:30,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:12:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2019-08-05 10:12:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 4171. [2019-08-05 10:12:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4171 states. [2019-08-05 10:12:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 19631 transitions. [2019-08-05 10:12:31,215 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 19631 transitions. Word has length 8 [2019-08-05 10:12:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:31,216 INFO L475 AbstractCegarLoop]: Abstraction has 4171 states and 19631 transitions. [2019-08-05 10:12:31,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 19631 transitions. [2019-08-05 10:12:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:31,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:31,218 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:31,218 INFO L418 AbstractCegarLoop]: === Iteration 43 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:31,218 INFO L82 PathProgramCache]: Analyzing trace with hash -967288708, now seen corresponding path program 1 times [2019-08-05 10:12:31,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:31,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:12:31,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:31,350 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:12:31,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:31,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:31,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:31,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:31,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:31,352 INFO L87 Difference]: Start difference. First operand 4171 states and 19631 transitions. Second operand 8 states. [2019-08-05 10:12:34,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:34,218 INFO L93 Difference]: Finished difference Result 6065 states and 27317 transitions. [2019-08-05 10:12:34,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:12:34,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:34,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:34,268 INFO L225 Difference]: With dead ends: 6065 [2019-08-05 10:12:34,268 INFO L226 Difference]: Without dead ends: 6065 [2019-08-05 10:12:34,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:12:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2019-08-05 10:12:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 4179. [2019-08-05 10:12:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4179 states. [2019-08-05 10:12:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 19656 transitions. [2019-08-05 10:12:34,347 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 19656 transitions. Word has length 8 [2019-08-05 10:12:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:34,347 INFO L475 AbstractCegarLoop]: Abstraction has 4179 states and 19656 transitions. [2019-08-05 10:12:34,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 19656 transitions. [2019-08-05 10:12:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:34,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:34,349 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:34,349 INFO L418 AbstractCegarLoop]: === Iteration 44 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash -974972405, now seen corresponding path program 1 times [2019-08-05 10:12:34,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:34,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:12:34,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:34,435 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:12:34,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:34,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:34,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:34,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:34,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:34,436 INFO L87 Difference]: Start difference. First operand 4179 states and 19656 transitions. Second operand 8 states. [2019-08-05 10:12:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:37,236 INFO L93 Difference]: Finished difference Result 6632 states and 29820 transitions. [2019-08-05 10:12:37,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:12:37,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:37,252 INFO L225 Difference]: With dead ends: 6632 [2019-08-05 10:12:37,252 INFO L226 Difference]: Without dead ends: 6632 [2019-08-05 10:12:37,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:12:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6632 states. [2019-08-05 10:12:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6632 to 4323. [2019-08-05 10:12:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4323 states. [2019-08-05 10:12:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4323 states to 4323 states and 20373 transitions. [2019-08-05 10:12:37,348 INFO L78 Accepts]: Start accepts. Automaton has 4323 states and 20373 transitions. Word has length 8 [2019-08-05 10:12:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:37,348 INFO L475 AbstractCegarLoop]: Abstraction has 4323 states and 20373 transitions. [2019-08-05 10:12:37,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 4323 states and 20373 transitions. [2019-08-05 10:12:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:37,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:37,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:37,350 INFO L418 AbstractCegarLoop]: === Iteration 45 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash -974972402, now seen corresponding path program 1 times [2019-08-05 10:12:37,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:37,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:12:37,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:37,434 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:12:37,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:37,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:37,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:37,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:37,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:37,436 INFO L87 Difference]: Start difference. First operand 4323 states and 20373 transitions. Second operand 8 states. [2019-08-05 10:12:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:40,146 INFO L93 Difference]: Finished difference Result 7111 states and 32199 transitions. [2019-08-05 10:12:40,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:12:40,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:40,166 INFO L225 Difference]: With dead ends: 7111 [2019-08-05 10:12:40,166 INFO L226 Difference]: Without dead ends: 7111 [2019-08-05 10:12:40,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:12:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7111 states. [2019-08-05 10:12:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7111 to 4647. [2019-08-05 10:12:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4647 states. [2019-08-05 10:12:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 22048 transitions. [2019-08-05 10:12:40,332 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 22048 transitions. Word has length 8 [2019-08-05 10:12:40,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:40,332 INFO L475 AbstractCegarLoop]: Abstraction has 4647 states and 22048 transitions. [2019-08-05 10:12:40,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 22048 transitions. [2019-08-05 10:12:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:40,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:40,334 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:40,334 INFO L418 AbstractCegarLoop]: === Iteration 46 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:40,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:40,335 INFO L82 PathProgramCache]: Analyzing trace with hash -974972399, now seen corresponding path program 1 times [2019-08-05 10:12:40,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:40,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:12:40,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:40,421 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:12:40,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:40,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:40,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:40,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:40,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:40,423 INFO L87 Difference]: Start difference. First operand 4647 states and 22048 transitions. Second operand 8 states. [2019-08-05 10:12:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:43,053 INFO L93 Difference]: Finished difference Result 7152 states and 32341 transitions. [2019-08-05 10:12:43,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:12:43,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:43,075 INFO L225 Difference]: With dead ends: 7152 [2019-08-05 10:12:43,075 INFO L226 Difference]: Without dead ends: 7152 [2019-08-05 10:12:43,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:12:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7152 states. [2019-08-05 10:12:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7152 to 4740. [2019-08-05 10:12:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4740 states. [2019-08-05 10:12:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4740 states to 4740 states and 22499 transitions. [2019-08-05 10:12:43,250 INFO L78 Accepts]: Start accepts. Automaton has 4740 states and 22499 transitions. Word has length 8 [2019-08-05 10:12:43,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:43,251 INFO L475 AbstractCegarLoop]: Abstraction has 4740 states and 22499 transitions. [2019-08-05 10:12:43,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 4740 states and 22499 transitions. [2019-08-05 10:12:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:43,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:43,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:43,253 INFO L418 AbstractCegarLoop]: === Iteration 47 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:43,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:43,253 INFO L82 PathProgramCache]: Analyzing trace with hash -974965182, now seen corresponding path program 1 times [2019-08-05 10:12:43,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:43,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:12:43,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:43,346 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:12:43,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:43,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:43,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:43,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:43,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:43,347 INFO L87 Difference]: Start difference. First operand 4740 states and 22499 transitions. Second operand 8 states. [2019-08-05 10:12:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:46,767 INFO L93 Difference]: Finished difference Result 7192 states and 32407 transitions. [2019-08-05 10:12:46,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:12:46,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:46,787 INFO L225 Difference]: With dead ends: 7192 [2019-08-05 10:12:46,788 INFO L226 Difference]: Without dead ends: 7192 [2019-08-05 10:12:46,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:12:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2019-08-05 10:12:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 4760. [2019-08-05 10:12:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4760 states. [2019-08-05 10:12:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 22618 transitions. [2019-08-05 10:12:46,959 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 22618 transitions. Word has length 8 [2019-08-05 10:12:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:46,960 INFO L475 AbstractCegarLoop]: Abstraction has 4760 states and 22618 transitions. [2019-08-05 10:12:46,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 22618 transitions. [2019-08-05 10:12:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:46,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:46,961 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:46,961 INFO L418 AbstractCegarLoop]: === Iteration 48 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:46,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:46,961 INFO L82 PathProgramCache]: Analyzing trace with hash -974965179, now seen corresponding path program 1 times [2019-08-05 10:12:46,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:46,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:12:46,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:47,048 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:12:47,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:47,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:47,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:47,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:47,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:47,050 INFO L87 Difference]: Start difference. First operand 4760 states and 22618 transitions. Second operand 8 states. [2019-08-05 10:12:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:50,468 INFO L93 Difference]: Finished difference Result 7465 states and 33681 transitions. [2019-08-05 10:12:50,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:12:50,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:50,486 INFO L225 Difference]: With dead ends: 7465 [2019-08-05 10:12:50,487 INFO L226 Difference]: Without dead ends: 7465 [2019-08-05 10:12:50,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:12:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2019-08-05 10:12:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 4694. [2019-08-05 10:12:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4694 states. [2019-08-05 10:12:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 22291 transitions. [2019-08-05 10:12:50,576 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 22291 transitions. Word has length 8 [2019-08-05 10:12:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:50,577 INFO L475 AbstractCegarLoop]: Abstraction has 4694 states and 22291 transitions. [2019-08-05 10:12:50,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 22291 transitions. [2019-08-05 10:12:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:50,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:50,578 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:50,578 INFO L418 AbstractCegarLoop]: === Iteration 49 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:50,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:50,579 INFO L82 PathProgramCache]: Analyzing trace with hash -974965176, now seen corresponding path program 1 times [2019-08-05 10:12:50,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:50,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:12:50,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:50,691 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:12:50,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:50,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:50,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:50,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:50,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:50,692 INFO L87 Difference]: Start difference. First operand 4694 states and 22291 transitions. Second operand 8 states. [2019-08-05 10:12:53,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:53,794 INFO L93 Difference]: Finished difference Result 7180 states and 32444 transitions. [2019-08-05 10:12:53,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:12:53,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:53,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:53,814 INFO L225 Difference]: With dead ends: 7180 [2019-08-05 10:12:53,814 INFO L226 Difference]: Without dead ends: 7180 [2019-08-05 10:12:53,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:12:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7180 states. [2019-08-05 10:12:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7180 to 4678. [2019-08-05 10:12:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4678 states. [2019-08-05 10:12:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4678 states to 4678 states and 22222 transitions. [2019-08-05 10:12:54,014 INFO L78 Accepts]: Start accepts. Automaton has 4678 states and 22222 transitions. Word has length 8 [2019-08-05 10:12:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:54,015 INFO L475 AbstractCegarLoop]: Abstraction has 4678 states and 22222 transitions. [2019-08-05 10:12:54,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4678 states and 22222 transitions. [2019-08-05 10:12:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:54,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:54,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:54,016 INFO L418 AbstractCegarLoop]: === Iteration 50 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:54,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:54,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1363685373, now seen corresponding path program 1 times [2019-08-05 10:12:54,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:54,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:12:54,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:54,223 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:12:54,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:54,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:54,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:54,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:54,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:54,225 INFO L87 Difference]: Start difference. First operand 4678 states and 22222 transitions. Second operand 8 states. [2019-08-05 10:12:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:58,095 INFO L93 Difference]: Finished difference Result 9663 states and 43628 transitions. [2019-08-05 10:12:58,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:12:58,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:12:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:58,204 INFO L225 Difference]: With dead ends: 9663 [2019-08-05 10:12:58,205 INFO L226 Difference]: Without dead ends: 9663 [2019-08-05 10:12:58,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:12:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9663 states. [2019-08-05 10:12:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9663 to 5208. [2019-08-05 10:12:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5208 states. [2019-08-05 10:12:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 25006 transitions. [2019-08-05 10:12:58,364 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 25006 transitions. Word has length 8 [2019-08-05 10:12:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:58,364 INFO L475 AbstractCegarLoop]: Abstraction has 5208 states and 25006 transitions. [2019-08-05 10:12:58,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 25006 transitions. [2019-08-05 10:12:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:58,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:58,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:58,366 INFO L418 AbstractCegarLoop]: === Iteration 51 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1363685370, now seen corresponding path program 1 times [2019-08-05 10:12:58,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:58,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:12:58,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:58,454 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:12:58,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:58,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:12:58,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:58,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:58,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:58,456 INFO L87 Difference]: Start difference. First operand 5208 states and 25006 transitions. Second operand 8 states. [2019-08-05 10:13:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:02,699 INFO L93 Difference]: Finished difference Result 11152 states and 50928 transitions. [2019-08-05 10:13:02,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:13:02,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:02,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:02,729 INFO L225 Difference]: With dead ends: 11152 [2019-08-05 10:13:02,730 INFO L226 Difference]: Without dead ends: 11152 [2019-08-05 10:13:02,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:13:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11152 states. [2019-08-05 10:13:02,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11152 to 5546. [2019-08-05 10:13:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5546 states. [2019-08-05 10:13:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5546 states to 5546 states and 26797 transitions. [2019-08-05 10:13:02,851 INFO L78 Accepts]: Start accepts. Automaton has 5546 states and 26797 transitions. Word has length 8 [2019-08-05 10:13:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:02,851 INFO L475 AbstractCegarLoop]: Abstraction has 5546 states and 26797 transitions. [2019-08-05 10:13:02,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5546 states and 26797 transitions. [2019-08-05 10:13:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:02,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:02,853 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:02,854 INFO L418 AbstractCegarLoop]: === Iteration 52 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1363685367, now seen corresponding path program 1 times [2019-08-05 10:13:02,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:02,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:13:02,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:02,937 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:13:02,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:02,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:02,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:02,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:02,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:02,939 INFO L87 Difference]: Start difference. First operand 5546 states and 26797 transitions. Second operand 8 states. [2019-08-05 10:13:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:06,897 INFO L93 Difference]: Finished difference Result 9845 states and 44713 transitions. [2019-08-05 10:13:06,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:13:06,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:06,924 INFO L225 Difference]: With dead ends: 9845 [2019-08-05 10:13:06,924 INFO L226 Difference]: Without dead ends: 9845 [2019-08-05 10:13:06,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:13:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9845 states. [2019-08-05 10:13:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9845 to 5633. [2019-08-05 10:13:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5633 states. [2019-08-05 10:13:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5633 states to 5633 states and 27274 transitions. [2019-08-05 10:13:07,047 INFO L78 Accepts]: Start accepts. Automaton has 5633 states and 27274 transitions. Word has length 8 [2019-08-05 10:13:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:07,047 INFO L475 AbstractCegarLoop]: Abstraction has 5633 states and 27274 transitions. [2019-08-05 10:13:07,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 5633 states and 27274 transitions. [2019-08-05 10:13:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:07,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:07,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:07,049 INFO L418 AbstractCegarLoop]: === Iteration 53 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:07,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:07,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1363678150, now seen corresponding path program 1 times [2019-08-05 10:13:07,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:07,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:13:07,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,885 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:13:07,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:07,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:07,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:07,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:07,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:07,886 INFO L87 Difference]: Start difference. First operand 5633 states and 27274 transitions. Second operand 8 states. [2019-08-05 10:13:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:12,454 INFO L93 Difference]: Finished difference Result 9645 states and 43695 transitions. [2019-08-05 10:13:12,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:13:12,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:12,481 INFO L225 Difference]: With dead ends: 9645 [2019-08-05 10:13:12,481 INFO L226 Difference]: Without dead ends: 9645 [2019-08-05 10:13:12,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9645 states. [2019-08-05 10:13:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9645 to 5626. [2019-08-05 10:13:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5626 states. [2019-08-05 10:13:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5626 states to 5626 states and 27244 transitions. [2019-08-05 10:13:12,621 INFO L78 Accepts]: Start accepts. Automaton has 5626 states and 27244 transitions. Word has length 8 [2019-08-05 10:13:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:12,621 INFO L475 AbstractCegarLoop]: Abstraction has 5626 states and 27244 transitions. [2019-08-05 10:13:12,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 5626 states and 27244 transitions. [2019-08-05 10:13:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:12,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:12,622 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:12,623 INFO L418 AbstractCegarLoop]: === Iteration 54 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:12,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:12,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1363678147, now seen corresponding path program 1 times [2019-08-05 10:13:12,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:12,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:13:12,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:12,741 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:13:12,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:12,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:12,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:12,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:12,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:12,743 INFO L87 Difference]: Start difference. First operand 5626 states and 27244 transitions. Second operand 8 states. [2019-08-05 10:13:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:17,329 INFO L93 Difference]: Finished difference Result 10055 states and 45701 transitions. [2019-08-05 10:13:17,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:13:17,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:17,354 INFO L225 Difference]: With dead ends: 10055 [2019-08-05 10:13:17,354 INFO L226 Difference]: Without dead ends: 10055 [2019-08-05 10:13:17,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10055 states. [2019-08-05 10:13:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10055 to 5166. [2019-08-05 10:13:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-08-05 10:13:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 24812 transitions. [2019-08-05 10:13:17,472 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 24812 transitions. Word has length 8 [2019-08-05 10:13:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:17,472 INFO L475 AbstractCegarLoop]: Abstraction has 5166 states and 24812 transitions. [2019-08-05 10:13:17,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 24812 transitions. [2019-08-05 10:13:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:17,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:17,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:17,473 INFO L418 AbstractCegarLoop]: === Iteration 55 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:17,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:17,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1363678144, now seen corresponding path program 1 times [2019-08-05 10:13:17,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:17,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:13:17,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:17,551 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:13:17,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:17,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:17,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:17,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:17,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:17,552 INFO L87 Difference]: Start difference. First operand 5166 states and 24812 transitions. Second operand 8 states. [2019-08-05 10:13:21,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:21,881 INFO L93 Difference]: Finished difference Result 8813 states and 39779 transitions. [2019-08-05 10:13:21,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:13:21,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:21,905 INFO L225 Difference]: With dead ends: 8813 [2019-08-05 10:13:21,905 INFO L226 Difference]: Without dead ends: 8813 [2019-08-05 10:13:21,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8813 states. [2019-08-05 10:13:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8813 to 5150. [2019-08-05 10:13:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5150 states. [2019-08-05 10:13:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5150 states to 5150 states and 24743 transitions. [2019-08-05 10:13:22,000 INFO L78 Accepts]: Start accepts. Automaton has 5150 states and 24743 transitions. Word has length 8 [2019-08-05 10:13:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:22,000 INFO L475 AbstractCegarLoop]: Abstraction has 5150 states and 24743 transitions. [2019-08-05 10:13:22,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 5150 states and 24743 transitions. [2019-08-05 10:13:22,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:22,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:22,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:22,001 INFO L418 AbstractCegarLoop]: === Iteration 56 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:22,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:22,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1364121667, now seen corresponding path program 1 times [2019-08-05 10:13:22,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:22,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:13:22,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:22,867 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:13:22,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:22,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:22,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:22,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:22,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:22,869 INFO L87 Difference]: Start difference. First operand 5150 states and 24743 transitions. Second operand 8 states. [2019-08-05 10:13:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:26,789 INFO L93 Difference]: Finished difference Result 9193 states and 41838 transitions. [2019-08-05 10:13:26,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:26,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:26,812 INFO L225 Difference]: With dead ends: 9193 [2019-08-05 10:13:26,813 INFO L226 Difference]: Without dead ends: 9193 [2019-08-05 10:13:26,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9193 states. [2019-08-05 10:13:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9193 to 5097. [2019-08-05 10:13:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5097 states. [2019-08-05 10:13:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5097 states to 5097 states and 24470 transitions. [2019-08-05 10:13:26,929 INFO L78 Accepts]: Start accepts. Automaton has 5097 states and 24470 transitions. Word has length 8 [2019-08-05 10:13:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:26,929 INFO L475 AbstractCegarLoop]: Abstraction has 5097 states and 24470 transitions. [2019-08-05 10:13:26,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5097 states and 24470 transitions. [2019-08-05 10:13:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:26,930 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:26,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:26,931 INFO L418 AbstractCegarLoop]: === Iteration 57 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:26,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:26,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1364121664, now seen corresponding path program 1 times [2019-08-05 10:13:26,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:26,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:13:26,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:27,088 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:13:27,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:27,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:27,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:27,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:27,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:27,090 INFO L87 Difference]: Start difference. First operand 5097 states and 24470 transitions. Second operand 8 states. [2019-08-05 10:13:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:30,775 INFO L93 Difference]: Finished difference Result 9713 states and 44313 transitions. [2019-08-05 10:13:30,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:30,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:30,800 INFO L225 Difference]: With dead ends: 9713 [2019-08-05 10:13:30,800 INFO L226 Difference]: Without dead ends: 9713 [2019-08-05 10:13:30,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9713 states. [2019-08-05 10:13:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9713 to 4999. [2019-08-05 10:13:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4999 states. [2019-08-05 10:13:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 23973 transitions. [2019-08-05 10:13:30,917 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 23973 transitions. Word has length 8 [2019-08-05 10:13:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:30,918 INFO L475 AbstractCegarLoop]: Abstraction has 4999 states and 23973 transitions. [2019-08-05 10:13:30,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 23973 transitions. [2019-08-05 10:13:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:30,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:30,919 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:30,919 INFO L418 AbstractCegarLoop]: === Iteration 58 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:30,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:30,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1364121661, now seen corresponding path program 1 times [2019-08-05 10:13:30,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:30,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:13:30,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:31,077 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:13:31,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:31,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:31,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:31,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:31,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:31,079 INFO L87 Difference]: Start difference. First operand 4999 states and 23973 transitions. Second operand 8 states. [2019-08-05 10:13:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:34,479 INFO L93 Difference]: Finished difference Result 8722 states and 39612 transitions. [2019-08-05 10:13:34,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:34,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:34,504 INFO L225 Difference]: With dead ends: 8722 [2019-08-05 10:13:34,504 INFO L226 Difference]: Without dead ends: 8722 [2019-08-05 10:13:34,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8722 states. [2019-08-05 10:13:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8722 to 5028. [2019-08-05 10:13:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5028 states. [2019-08-05 10:13:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 24143 transitions. [2019-08-05 10:13:34,622 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 24143 transitions. Word has length 8 [2019-08-05 10:13:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:34,622 INFO L475 AbstractCegarLoop]: Abstraction has 5028 states and 24143 transitions. [2019-08-05 10:13:34,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 24143 transitions. [2019-08-05 10:13:34,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:34,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:34,624 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:34,624 INFO L418 AbstractCegarLoop]: === Iteration 59 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:34,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:34,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1364128363, now seen corresponding path program 1 times [2019-08-05 10:13:34,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:34,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:13:34,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:34,717 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:13:34,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:34,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:34,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:34,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:34,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:34,719 INFO L87 Difference]: Start difference. First operand 5028 states and 24143 transitions. Second operand 8 states. [2019-08-05 10:13:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:38,331 INFO L93 Difference]: Finished difference Result 9164 states and 41341 transitions. [2019-08-05 10:13:38,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:38,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:38,356 INFO L225 Difference]: With dead ends: 9164 [2019-08-05 10:13:38,433 INFO L226 Difference]: Without dead ends: 9164 [2019-08-05 10:13:38,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:13:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9164 states. [2019-08-05 10:13:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9164 to 5301. [2019-08-05 10:13:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5301 states. [2019-08-05 10:13:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5301 states to 5301 states and 25378 transitions. [2019-08-05 10:13:38,530 INFO L78 Accepts]: Start accepts. Automaton has 5301 states and 25378 transitions. Word has length 8 [2019-08-05 10:13:38,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:38,530 INFO L475 AbstractCegarLoop]: Abstraction has 5301 states and 25378 transitions. [2019-08-05 10:13:38,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 5301 states and 25378 transitions. [2019-08-05 10:13:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:38,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:38,531 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:38,532 INFO L418 AbstractCegarLoop]: === Iteration 60 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:38,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:38,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1364128360, now seen corresponding path program 1 times [2019-08-05 10:13:38,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:38,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:13:38,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:38,613 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:13:38,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:38,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:38,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:38,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:38,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:38,615 INFO L87 Difference]: Start difference. First operand 5301 states and 25378 transitions. Second operand 8 states. [2019-08-05 10:13:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:42,288 INFO L93 Difference]: Finished difference Result 9090 states and 41030 transitions. [2019-08-05 10:13:42,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:42,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:42,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:42,314 INFO L225 Difference]: With dead ends: 9090 [2019-08-05 10:13:42,314 INFO L226 Difference]: Without dead ends: 9090 [2019-08-05 10:13:42,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:13:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9090 states. [2019-08-05 10:13:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9090 to 5325. [2019-08-05 10:13:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5325 states. [2019-08-05 10:13:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 25474 transitions. [2019-08-05 10:13:42,430 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 25474 transitions. Word has length 8 [2019-08-05 10:13:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:42,430 INFO L475 AbstractCegarLoop]: Abstraction has 5325 states and 25474 transitions. [2019-08-05 10:13:42,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 25474 transitions. [2019-08-05 10:13:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:42,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:42,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:42,432 INFO L418 AbstractCegarLoop]: === Iteration 61 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:42,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:42,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1364128357, now seen corresponding path program 1 times [2019-08-05 10:13:42,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:42,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:13:42,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:42,569 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:13:42,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:42,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:42,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:42,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:42,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:42,570 INFO L87 Difference]: Start difference. First operand 5325 states and 25474 transitions. Second operand 8 states. [2019-08-05 10:13:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:46,035 INFO L93 Difference]: Finished difference Result 9051 states and 40872 transitions. [2019-08-05 10:13:46,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:46,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:46,057 INFO L225 Difference]: With dead ends: 9051 [2019-08-05 10:13:46,057 INFO L226 Difference]: Without dead ends: 9051 [2019-08-05 10:13:46,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:13:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2019-08-05 10:13:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 5486. [2019-08-05 10:13:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5486 states. [2019-08-05 10:13:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 26254 transitions. [2019-08-05 10:13:46,151 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 26254 transitions. Word has length 8 [2019-08-05 10:13:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:46,151 INFO L475 AbstractCegarLoop]: Abstraction has 5486 states and 26254 transitions. [2019-08-05 10:13:46,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 26254 transitions. [2019-08-05 10:13:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:46,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:46,152 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:46,152 INFO L418 AbstractCegarLoop]: === Iteration 62 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:46,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:46,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1363773754, now seen corresponding path program 1 times [2019-08-05 10:13:46,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:46,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:13:46,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:46,288 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:13:46,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:46,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:46,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:46,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:46,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:46,289 INFO L87 Difference]: Start difference. First operand 5486 states and 26254 transitions. Second operand 8 states. [2019-08-05 10:13:46,806 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:13:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:51,095 INFO L93 Difference]: Finished difference Result 10918 states and 48965 transitions. [2019-08-05 10:13:51,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:13:51,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:51,123 INFO L225 Difference]: With dead ends: 10918 [2019-08-05 10:13:51,123 INFO L226 Difference]: Without dead ends: 10918 [2019-08-05 10:13:51,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10918 states. [2019-08-05 10:13:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10918 to 6125. [2019-08-05 10:13:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6125 states. [2019-08-05 10:13:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6125 states to 6125 states and 29379 transitions. [2019-08-05 10:13:51,245 INFO L78 Accepts]: Start accepts. Automaton has 6125 states and 29379 transitions. Word has length 8 [2019-08-05 10:13:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:51,245 INFO L475 AbstractCegarLoop]: Abstraction has 6125 states and 29379 transitions. [2019-08-05 10:13:51,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:51,246 INFO L276 IsEmpty]: Start isEmpty. Operand 6125 states and 29379 transitions. [2019-08-05 10:13:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:51,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:51,247 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:51,247 INFO L418 AbstractCegarLoop]: === Iteration 63 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:51,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:51,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1363773751, now seen corresponding path program 1 times [2019-08-05 10:13:51,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:51,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:13:51,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:51,433 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:13:51,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:51,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:51,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:51,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:51,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:51,434 INFO L87 Difference]: Start difference. First operand 6125 states and 29379 transitions. Second operand 8 states. [2019-08-05 10:13:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:55,665 INFO L93 Difference]: Finished difference Result 10837 states and 48667 transitions. [2019-08-05 10:13:55,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:13:55,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:13:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:55,694 INFO L225 Difference]: With dead ends: 10837 [2019-08-05 10:13:55,695 INFO L226 Difference]: Without dead ends: 10837 [2019-08-05 10:13:55,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10837 states. [2019-08-05 10:13:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10837 to 6180. [2019-08-05 10:13:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6180 states. [2019-08-05 10:13:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6180 states to 6180 states and 29650 transitions. [2019-08-05 10:13:55,834 INFO L78 Accepts]: Start accepts. Automaton has 6180 states and 29650 transitions. Word has length 8 [2019-08-05 10:13:55,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:55,834 INFO L475 AbstractCegarLoop]: Abstraction has 6180 states and 29650 transitions. [2019-08-05 10:13:55,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 6180 states and 29650 transitions. [2019-08-05 10:13:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:13:55,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:55,836 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:55,836 INFO L418 AbstractCegarLoop]: === Iteration 64 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:55,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:55,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1363773748, now seen corresponding path program 1 times [2019-08-05 10:13:55,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:55,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:13:55,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:55,914 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:13:55,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:55,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:55,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:55,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:55,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:55,916 INFO L87 Difference]: Start difference. First operand 6180 states and 29650 transitions. Second operand 8 states. [2019-08-05 10:14:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:00,155 INFO L93 Difference]: Finished difference Result 10766 states and 48394 transitions. [2019-08-05 10:14:00,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:14:00,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:00,183 INFO L225 Difference]: With dead ends: 10766 [2019-08-05 10:14:00,184 INFO L226 Difference]: Without dead ends: 10766 [2019-08-05 10:14:00,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:14:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10766 states. [2019-08-05 10:14:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10766 to 5851. [2019-08-05 10:14:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5851 states. [2019-08-05 10:14:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5851 states to 5851 states and 28115 transitions. [2019-08-05 10:14:00,300 INFO L78 Accepts]: Start accepts. Automaton has 5851 states and 28115 transitions. Word has length 8 [2019-08-05 10:14:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:00,301 INFO L475 AbstractCegarLoop]: Abstraction has 5851 states and 28115 transitions. [2019-08-05 10:14:00,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5851 states and 28115 transitions. [2019-08-05 10:14:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:00,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:00,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:00,303 INFO L418 AbstractCegarLoop]: === Iteration 65 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:00,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:00,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1363765601, now seen corresponding path program 1 times [2019-08-05 10:14:00,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:00,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:14:00,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:00,389 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:14:00,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:00,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:00,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:00,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:00,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:00,391 INFO L87 Difference]: Start difference. First operand 5851 states and 28115 transitions. Second operand 8 states. [2019-08-05 10:14:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:05,384 INFO L93 Difference]: Finished difference Result 9694 states and 43415 transitions. [2019-08-05 10:14:05,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:14:05,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:05,409 INFO L225 Difference]: With dead ends: 9694 [2019-08-05 10:14:05,409 INFO L226 Difference]: Without dead ends: 9694 [2019-08-05 10:14:05,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:14:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9694 states. [2019-08-05 10:14:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9694 to 5675. [2019-08-05 10:14:05,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5675 states. [2019-08-05 10:14:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5675 states to 5675 states and 27225 transitions. [2019-08-05 10:14:05,537 INFO L78 Accepts]: Start accepts. Automaton has 5675 states and 27225 transitions. Word has length 8 [2019-08-05 10:14:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:05,537 INFO L475 AbstractCegarLoop]: Abstraction has 5675 states and 27225 transitions. [2019-08-05 10:14:05,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5675 states and 27225 transitions. [2019-08-05 10:14:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:05,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:05,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:05,539 INFO L418 AbstractCegarLoop]: === Iteration 66 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1363765598, now seen corresponding path program 1 times [2019-08-05 10:14:05,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:05,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:14:05,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:05,610 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:14:05,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:05,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:05,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:05,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:05,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:05,611 INFO L87 Difference]: Start difference. First operand 5675 states and 27225 transitions. Second operand 8 states. [2019-08-05 10:14:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:10,442 INFO L93 Difference]: Finished difference Result 9307 states and 41662 transitions. [2019-08-05 10:14:10,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:14:10,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:10,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:10,465 INFO L225 Difference]: With dead ends: 9307 [2019-08-05 10:14:10,465 INFO L226 Difference]: Without dead ends: 9307 [2019-08-05 10:14:10,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:14:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9307 states. [2019-08-05 10:14:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9307 to 5639. [2019-08-05 10:14:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5639 states. [2019-08-05 10:14:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5639 states to 5639 states and 27043 transitions. [2019-08-05 10:14:10,572 INFO L78 Accepts]: Start accepts. Automaton has 5639 states and 27043 transitions. Word has length 8 [2019-08-05 10:14:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:10,572 INFO L475 AbstractCegarLoop]: Abstraction has 5639 states and 27043 transitions. [2019-08-05 10:14:10,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 27043 transitions. [2019-08-05 10:14:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:10,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:10,573 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:10,573 INFO L418 AbstractCegarLoop]: === Iteration 67 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:10,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1363765595, now seen corresponding path program 1 times [2019-08-05 10:14:10,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:10,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:14:10,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:10,672 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:14:10,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:10,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:10,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:10,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:10,673 INFO L87 Difference]: Start difference. First operand 5639 states and 27043 transitions. Second operand 8 states. [2019-08-05 10:14:14,592 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:14:15,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:15,928 INFO L93 Difference]: Finished difference Result 9144 states and 41056 transitions. [2019-08-05 10:14:15,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:14:15,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:15,951 INFO L225 Difference]: With dead ends: 9144 [2019-08-05 10:14:15,951 INFO L226 Difference]: Without dead ends: 9144 [2019-08-05 10:14:15,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:14:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9144 states. [2019-08-05 10:14:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9144 to 5427. [2019-08-05 10:14:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5427 states. [2019-08-05 10:14:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5427 states to 5427 states and 26001 transitions. [2019-08-05 10:14:16,159 INFO L78 Accepts]: Start accepts. Automaton has 5427 states and 26001 transitions. Word has length 8 [2019-08-05 10:14:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:16,159 INFO L475 AbstractCegarLoop]: Abstraction has 5427 states and 26001 transitions. [2019-08-05 10:14:16,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 5427 states and 26001 transitions. [2019-08-05 10:14:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:16,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:16,161 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:16,161 INFO L418 AbstractCegarLoop]: === Iteration 68 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:16,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:16,161 INFO L82 PathProgramCache]: Analyzing trace with hash -34201424, now seen corresponding path program 1 times [2019-08-05 10:14:16,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:16,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:14:16,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:16,223 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:14:16,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:16,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:16,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:16,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:16,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:16,225 INFO L87 Difference]: Start difference. First operand 5427 states and 26001 transitions. Second operand 8 states. [2019-08-05 10:14:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:19,385 INFO L93 Difference]: Finished difference Result 12659 states and 57957 transitions. [2019-08-05 10:14:19,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:14:19,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:19,418 INFO L225 Difference]: With dead ends: 12659 [2019-08-05 10:14:19,418 INFO L226 Difference]: Without dead ends: 12659 [2019-08-05 10:14:19,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:14:19,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12659 states. [2019-08-05 10:14:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12659 to 7982. [2019-08-05 10:14:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7982 states. [2019-08-05 10:14:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7982 states to 7982 states and 38497 transitions. [2019-08-05 10:14:19,564 INFO L78 Accepts]: Start accepts. Automaton has 7982 states and 38497 transitions. Word has length 8 [2019-08-05 10:14:19,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:19,564 INFO L475 AbstractCegarLoop]: Abstraction has 7982 states and 38497 transitions. [2019-08-05 10:14:19,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 7982 states and 38497 transitions. [2019-08-05 10:14:19,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:19,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:19,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:19,566 INFO L418 AbstractCegarLoop]: === Iteration 69 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:19,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:19,566 INFO L82 PathProgramCache]: Analyzing trace with hash -34193271, now seen corresponding path program 1 times [2019-08-05 10:14:19,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:19,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:14:19,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:19,638 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:14:19,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:19,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:19,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:19,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:19,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:19,639 INFO L87 Difference]: Start difference. First operand 7982 states and 38497 transitions. Second operand 8 states. [2019-08-05 10:14:19,911 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:14:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:22,596 INFO L93 Difference]: Finished difference Result 12071 states and 55638 transitions. [2019-08-05 10:14:22,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:14:22,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:22,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:22,628 INFO L225 Difference]: With dead ends: 12071 [2019-08-05 10:14:22,628 INFO L226 Difference]: Without dead ends: 12071 [2019-08-05 10:14:22,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:14:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12071 states. [2019-08-05 10:14:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12071 to 7791. [2019-08-05 10:14:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7791 states. [2019-08-05 10:14:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7791 states to 7791 states and 37572 transitions. [2019-08-05 10:14:22,864 INFO L78 Accepts]: Start accepts. Automaton has 7791 states and 37572 transitions. Word has length 8 [2019-08-05 10:14:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:22,865 INFO L475 AbstractCegarLoop]: Abstraction has 7791 states and 37572 transitions. [2019-08-05 10:14:22,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 7791 states and 37572 transitions. [2019-08-05 10:14:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:22,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:22,867 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:22,867 INFO L418 AbstractCegarLoop]: === Iteration 70 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:22,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:22,868 INFO L82 PathProgramCache]: Analyzing trace with hash -33096274, now seen corresponding path program 1 times [2019-08-05 10:14:22,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:22,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:14:22,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:22,948 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:14:22,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:22,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:22,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:22,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:22,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:22,950 INFO L87 Difference]: Start difference. First operand 7791 states and 37572 transitions. Second operand 8 states. [2019-08-05 10:14:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:24,963 INFO L93 Difference]: Finished difference Result 11236 states and 52625 transitions. [2019-08-05 10:14:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:14:24,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:24,991 INFO L225 Difference]: With dead ends: 11236 [2019-08-05 10:14:24,992 INFO L226 Difference]: Without dead ends: 11236 [2019-08-05 10:14:24,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:14:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11236 states. [2019-08-05 10:14:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11236 to 7680. [2019-08-05 10:14:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7680 states. [2019-08-05 10:14:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7680 states to 7680 states and 36728 transitions. [2019-08-05 10:14:25,119 INFO L78 Accepts]: Start accepts. Automaton has 7680 states and 36728 transitions. Word has length 8 [2019-08-05 10:14:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:25,119 INFO L475 AbstractCegarLoop]: Abstraction has 7680 states and 36728 transitions. [2019-08-05 10:14:25,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 7680 states and 36728 transitions. [2019-08-05 10:14:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:25,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:25,121 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:25,121 INFO L418 AbstractCegarLoop]: === Iteration 71 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:25,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash 370476141, now seen corresponding path program 1 times [2019-08-05 10:14:25,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:25,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:14:25,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:25,274 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:14:25,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:25,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:25,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:25,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:25,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:25,275 INFO L87 Difference]: Start difference. First operand 7680 states and 36728 transitions. Second operand 8 states. [2019-08-05 10:14:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:27,904 INFO L93 Difference]: Finished difference Result 14068 states and 64639 transitions. [2019-08-05 10:14:27,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:14:27,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:27,940 INFO L225 Difference]: With dead ends: 14068 [2019-08-05 10:14:27,940 INFO L226 Difference]: Without dead ends: 14068 [2019-08-05 10:14:27,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:14:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14068 states. [2019-08-05 10:14:28,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14068 to 8401. [2019-08-05 10:14:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8401 states. [2019-08-05 10:14:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8401 states to 8401 states and 40332 transitions. [2019-08-05 10:14:28,298 INFO L78 Accepts]: Start accepts. Automaton has 8401 states and 40332 transitions. Word has length 8 [2019-08-05 10:14:28,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:28,299 INFO L475 AbstractCegarLoop]: Abstraction has 8401 states and 40332 transitions. [2019-08-05 10:14:28,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 8401 states and 40332 transitions. [2019-08-05 10:14:28,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:28,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:28,301 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:28,301 INFO L418 AbstractCegarLoop]: === Iteration 72 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:28,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:28,301 INFO L82 PathProgramCache]: Analyzing trace with hash 370476144, now seen corresponding path program 1 times [2019-08-05 10:14:28,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:28,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:14:28,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:28,405 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:14:28,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:28,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:28,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:28,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:28,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:28,406 INFO L87 Difference]: Start difference. First operand 8401 states and 40332 transitions. Second operand 8 states. [2019-08-05 10:14:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:30,848 INFO L93 Difference]: Finished difference Result 15618 states and 72198 transitions. [2019-08-05 10:14:30,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:14:30,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:30,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:30,891 INFO L225 Difference]: With dead ends: 15618 [2019-08-05 10:14:30,891 INFO L226 Difference]: Without dead ends: 15618 [2019-08-05 10:14:30,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:14:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states. [2019-08-05 10:14:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 8206. [2019-08-05 10:14:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2019-08-05 10:14:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 39504 transitions. [2019-08-05 10:14:31,070 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 39504 transitions. Word has length 8 [2019-08-05 10:14:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:31,070 INFO L475 AbstractCegarLoop]: Abstraction has 8206 states and 39504 transitions. [2019-08-05 10:14:31,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 39504 transitions. [2019-08-05 10:14:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:31,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:31,072 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:31,072 INFO L418 AbstractCegarLoop]: === Iteration 73 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:31,072 INFO L82 PathProgramCache]: Analyzing trace with hash 370476147, now seen corresponding path program 1 times [2019-08-05 10:14:31,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:31,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:14:31,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:31,160 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:14:31,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:31,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:31,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:31,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:31,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:31,161 INFO L87 Difference]: Start difference. First operand 8206 states and 39504 transitions. Second operand 8 states. [2019-08-05 10:14:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:33,628 INFO L93 Difference]: Finished difference Result 13720 states and 63181 transitions. [2019-08-05 10:14:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:14:33,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:33,664 INFO L225 Difference]: With dead ends: 13720 [2019-08-05 10:14:33,664 INFO L226 Difference]: Without dead ends: 13720 [2019-08-05 10:14:33,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:14:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13720 states. [2019-08-05 10:14:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13720 to 6375. [2019-08-05 10:14:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6375 states. [2019-08-05 10:14:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6375 states to 6375 states and 30586 transitions. [2019-08-05 10:14:33,811 INFO L78 Accepts]: Start accepts. Automaton has 6375 states and 30586 transitions. Word has length 8 [2019-08-05 10:14:33,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:33,811 INFO L475 AbstractCegarLoop]: Abstraction has 6375 states and 30586 transitions. [2019-08-05 10:14:33,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 6375 states and 30586 transitions. [2019-08-05 10:14:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:33,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:33,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:33,813 INFO L418 AbstractCegarLoop]: === Iteration 74 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:33,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:33,813 INFO L82 PathProgramCache]: Analyzing trace with hash 357550226, now seen corresponding path program 1 times [2019-08-05 10:14:33,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:33,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:14:33,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:33,889 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:14:33,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:33,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:33,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:33,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:33,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:33,890 INFO L87 Difference]: Start difference. First operand 6375 states and 30586 transitions. Second operand 8 states. [2019-08-05 10:14:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:37,413 INFO L93 Difference]: Finished difference Result 12880 states and 57799 transitions. [2019-08-05 10:14:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:14:37,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:37,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:37,447 INFO L225 Difference]: With dead ends: 12880 [2019-08-05 10:14:37,447 INFO L226 Difference]: Without dead ends: 12880 [2019-08-05 10:14:37,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:14:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12880 states. [2019-08-05 10:14:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12880 to 6567. [2019-08-05 10:14:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6567 states. [2019-08-05 10:14:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6567 states to 6567 states and 31487 transitions. [2019-08-05 10:14:37,594 INFO L78 Accepts]: Start accepts. Automaton has 6567 states and 31487 transitions. Word has length 8 [2019-08-05 10:14:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:37,594 INFO L475 AbstractCegarLoop]: Abstraction has 6567 states and 31487 transitions. [2019-08-05 10:14:37,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6567 states and 31487 transitions. [2019-08-05 10:14:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:37,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:37,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:37,596 INFO L418 AbstractCegarLoop]: === Iteration 75 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash 357550229, now seen corresponding path program 1 times [2019-08-05 10:14:37,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:37,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:14:37,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:37,747 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:14:37,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:37,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:37,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:37,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:37,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:37,748 INFO L87 Difference]: Start difference. First operand 6567 states and 31487 transitions. Second operand 8 states. [2019-08-05 10:14:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:40,292 INFO L93 Difference]: Finished difference Result 14936 states and 68307 transitions. [2019-08-05 10:14:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:14:40,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:40,332 INFO L225 Difference]: With dead ends: 14936 [2019-08-05 10:14:40,333 INFO L226 Difference]: Without dead ends: 14936 [2019-08-05 10:14:40,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:14:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14936 states. [2019-08-05 10:14:40,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14936 to 6876. [2019-08-05 10:14:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6876 states. [2019-08-05 10:14:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6876 states to 6876 states and 32800 transitions. [2019-08-05 10:14:40,690 INFO L78 Accepts]: Start accepts. Automaton has 6876 states and 32800 transitions. Word has length 8 [2019-08-05 10:14:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:40,690 INFO L475 AbstractCegarLoop]: Abstraction has 6876 states and 32800 transitions. [2019-08-05 10:14:40,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 6876 states and 32800 transitions. [2019-08-05 10:14:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:40,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:40,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:40,692 INFO L418 AbstractCegarLoop]: === Iteration 76 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:40,692 INFO L82 PathProgramCache]: Analyzing trace with hash 357550232, now seen corresponding path program 1 times [2019-08-05 10:14:40,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:40,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:14:40,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:40,771 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:14:40,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:40,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:40,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:40,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:40,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:40,773 INFO L87 Difference]: Start difference. First operand 6876 states and 32800 transitions. Second operand 8 states. [2019-08-05 10:14:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:44,119 INFO L93 Difference]: Finished difference Result 12991 states and 58292 transitions. [2019-08-05 10:14:44,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:14:44,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:44,153 INFO L225 Difference]: With dead ends: 12991 [2019-08-05 10:14:44,153 INFO L226 Difference]: Without dead ends: 12991 [2019-08-05 10:14:44,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:14:44,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12991 states. [2019-08-05 10:14:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12991 to 6912. [2019-08-05 10:14:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6912 states. [2019-08-05 10:14:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6912 states to 6912 states and 32932 transitions. [2019-08-05 10:14:44,308 INFO L78 Accepts]: Start accepts. Automaton has 6912 states and 32932 transitions. Word has length 8 [2019-08-05 10:14:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:44,308 INFO L475 AbstractCegarLoop]: Abstraction has 6912 states and 32932 transitions. [2019-08-05 10:14:44,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 6912 states and 32932 transitions. [2019-08-05 10:14:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:44,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:44,310 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:44,310 INFO L418 AbstractCegarLoop]: === Iteration 77 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:44,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:44,310 INFO L82 PathProgramCache]: Analyzing trace with hash 357558379, now seen corresponding path program 1 times [2019-08-05 10:14:44,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:44,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:14:44,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:44,426 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:14:44,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:44,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:44,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:44,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:44,428 INFO L87 Difference]: Start difference. First operand 6912 states and 32932 transitions. Second operand 8 states. [2019-08-05 10:14:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:48,092 INFO L93 Difference]: Finished difference Result 12006 states and 54603 transitions. [2019-08-05 10:14:48,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:14:48,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:48,670 INFO L225 Difference]: With dead ends: 12006 [2019-08-05 10:14:48,670 INFO L226 Difference]: Without dead ends: 12006 [2019-08-05 10:14:48,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:14:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12006 states. [2019-08-05 10:14:48,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12006 to 6854. [2019-08-05 10:14:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6854 states. [2019-08-05 10:14:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6854 states to 6854 states and 32706 transitions. [2019-08-05 10:14:48,804 INFO L78 Accepts]: Start accepts. Automaton has 6854 states and 32706 transitions. Word has length 8 [2019-08-05 10:14:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:48,805 INFO L475 AbstractCegarLoop]: Abstraction has 6854 states and 32706 transitions. [2019-08-05 10:14:48,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 6854 states and 32706 transitions. [2019-08-05 10:14:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:48,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:48,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:48,806 INFO L418 AbstractCegarLoop]: === Iteration 78 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:48,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:48,806 INFO L82 PathProgramCache]: Analyzing trace with hash 357558382, now seen corresponding path program 1 times [2019-08-05 10:14:48,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:48,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:14:48,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:48,878 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:14:48,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:48,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:48,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:48,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:48,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:48,880 INFO L87 Difference]: Start difference. First operand 6854 states and 32706 transitions. Second operand 8 states. [2019-08-05 10:14:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:51,038 INFO L93 Difference]: Finished difference Result 12505 states and 57840 transitions. [2019-08-05 10:14:51,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:14:51,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:51,067 INFO L225 Difference]: With dead ends: 12505 [2019-08-05 10:14:51,068 INFO L226 Difference]: Without dead ends: 12505 [2019-08-05 10:14:51,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:14:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2019-08-05 10:14:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 6437. [2019-08-05 10:14:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6437 states. [2019-08-05 10:14:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6437 states to 6437 states and 30827 transitions. [2019-08-05 10:14:51,194 INFO L78 Accepts]: Start accepts. Automaton has 6437 states and 30827 transitions. Word has length 8 [2019-08-05 10:14:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:51,194 INFO L475 AbstractCegarLoop]: Abstraction has 6437 states and 30827 transitions. [2019-08-05 10:14:51,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:51,194 INFO L276 IsEmpty]: Start isEmpty. Operand 6437 states and 30827 transitions. [2019-08-05 10:14:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:51,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:51,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:51,195 INFO L418 AbstractCegarLoop]: === Iteration 79 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:51,196 INFO L82 PathProgramCache]: Analyzing trace with hash 357558385, now seen corresponding path program 1 times [2019-08-05 10:14:51,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:51,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:14:51,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:51,344 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:14:51,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:51,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:51,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:51,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:51,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:51,345 INFO L87 Difference]: Start difference. First operand 6437 states and 30827 transitions. Second operand 8 states. [2019-08-05 10:14:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:54,936 INFO L93 Difference]: Finished difference Result 11158 states and 50726 transitions. [2019-08-05 10:14:54,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:14:54,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:54,962 INFO L225 Difference]: With dead ends: 11158 [2019-08-05 10:14:54,962 INFO L226 Difference]: Without dead ends: 11158 [2019-08-05 10:14:54,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:14:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11158 states. [2019-08-05 10:14:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11158 to 5175. [2019-08-05 10:14:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5175 states. [2019-08-05 10:14:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 24861 transitions. [2019-08-05 10:14:55,203 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 24861 transitions. Word has length 8 [2019-08-05 10:14:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:55,203 INFO L475 AbstractCegarLoop]: Abstraction has 5175 states and 24861 transitions. [2019-08-05 10:14:55,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 24861 transitions. [2019-08-05 10:14:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:55,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:55,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:55,205 INFO L418 AbstractCegarLoop]: === Iteration 80 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:55,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1178437886, now seen corresponding path program 1 times [2019-08-05 10:14:55,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:55,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:14:55,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:55,298 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:14:55,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:55,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:55,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:55,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:55,299 INFO L87 Difference]: Start difference. First operand 5175 states and 24861 transitions. Second operand 8 states. [2019-08-05 10:14:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:58,740 INFO L93 Difference]: Finished difference Result 12408 states and 57446 transitions. [2019-08-05 10:14:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:14:58,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:58,773 INFO L225 Difference]: With dead ends: 12408 [2019-08-05 10:14:58,773 INFO L226 Difference]: Without dead ends: 12408 [2019-08-05 10:14:58,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:14:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12408 states. [2019-08-05 10:14:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12408 to 6701. [2019-08-05 10:14:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6701 states. [2019-08-05 10:14:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6701 states to 6701 states and 32585 transitions. [2019-08-05 10:14:58,914 INFO L78 Accepts]: Start accepts. Automaton has 6701 states and 32585 transitions. Word has length 8 [2019-08-05 10:14:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:58,914 INFO L475 AbstractCegarLoop]: Abstraction has 6701 states and 32585 transitions. [2019-08-05 10:14:58,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6701 states and 32585 transitions. [2019-08-05 10:14:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:58,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:58,916 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:58,916 INFO L418 AbstractCegarLoop]: === Iteration 81 === [productErr8ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:58,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:58,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1178444582, now seen corresponding path program 1 times [2019-08-05 10:14:58,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:58,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:14:58,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:58,989 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:14:58,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:58,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:58,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:58,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:58,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:58,991 INFO L87 Difference]: Start difference. First operand 6701 states and 32585 transitions. Second operand 8 states. Received shutdown request... [2019-08-05 10:15:01,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:15:01,169 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:15:01,174 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:15:01,175 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:15:01 BoogieIcfgContainer [2019-08-05 10:15:01,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:15:01,177 INFO L168 Benchmark]: Toolchain (without parser) took 248861.97 ms. Allocated memory was 136.8 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 111.9 MB in the beginning and 488.8 MB in the end (delta: -377.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-08-05 10:15:01,177 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 136.8 MB. Free memory is still 114.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:15:01,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.65 ms. Allocated memory is still 136.8 MB. Free memory was 111.9 MB in the beginning and 109.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:01,178 INFO L168 Benchmark]: Boogie Preprocessor took 64.91 ms. Allocated memory is still 136.8 MB. Free memory was 109.8 MB in the beginning and 108.1 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:15:01,179 INFO L168 Benchmark]: RCFGBuilder took 1381.38 ms. Allocated memory is still 136.8 MB. Free memory was 108.1 MB in the beginning and 65.3 MB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:01,180 INFO L168 Benchmark]: TraceAbstraction took 247366.53 ms. Allocated memory was 136.8 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 64.9 MB in the beginning and 488.8 MB in the end (delta: -424.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-08-05 10:15:01,182 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.19 ms. Allocated memory is still 136.8 MB. Free memory is still 114.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.65 ms. Allocated memory is still 136.8 MB. Free memory was 111.9 MB in the beginning and 109.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.91 ms. Allocated memory is still 136.8 MB. Free memory was 109.8 MB in the beginning and 108.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1381.38 ms. Allocated memory is still 136.8 MB. Free memory was 108.1 MB in the beginning and 65.3 MB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247366.53 ms. Allocated memory was 136.8 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 64.9 MB in the beginning and 488.8 MB in the end (delta: -424.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while BasicCegarLoop was constructing difference of abstraction (6701states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (1932 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 27 error locations. TIMEOUT Result, 247.2s OverallTime, 81 OverallIterations, 1 TraceHistogramMax, 226.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10823 SDtfs, 45435 SDslu, 17740 SDs, 0 SdLazy, 185728 SolverSat, 23306 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 169.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1326 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3657 ImplicationChecksByTransitivity, 26.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8401occurred in iteration=71, 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: 7.2s AutomataMinimizationTime, 80 MinimizatonAttempts, 193913 StatesRemovedByMinimization, 80 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 28452 SizeOfPredicates, 468 NumberOfNonLiveVariables, 3116 ConjunctsInSsa, 1000 ConjunctsInUnsatCore, 81 InterpolantComputations, 81 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown