java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:36:49,460 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:36:49,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:36:49,475 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:36:49,475 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:36:49,476 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:36:49,477 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:36:49,479 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:36:49,481 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:36:49,482 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:36:49,483 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:36:49,483 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:36:49,484 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:36:49,485 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:36:49,486 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:36:49,487 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:36:49,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:36:49,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:36:49,492 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:36:49,493 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:36:49,494 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:36:49,495 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:36:49,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:36:49,498 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:36:49,498 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:36:49,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:36:49,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:36:49,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:36:49,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:36:49,503 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:36:49,503 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:36:49,504 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:36:49,504 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:36:49,504 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:36:49,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:36:49,506 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:36:49,506 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:36:49,527 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:36:49,527 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:36:49,529 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:36:49,530 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:36:49,530 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:36:49,530 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:36:49,530 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:36:49,530 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:36:49,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:36:49,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:36:49,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:36:49,601 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:36:49,601 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:36:49,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-07-25 08:36:49,602 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-07-25 08:36:49,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:36:49,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:36:49,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:36:49,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:36:49,653 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:36:49,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:49" (1/1) ... [2018-07-25 08:36:49,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:49" (1/1) ... [2018-07-25 08:36:49,690 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 08:36:49,690 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 08:36:49,690 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 08:36:49,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:36:49,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:36:49,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:36:49,694 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:36:49,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:49" (1/1) ... [2018-07-25 08:36:49,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:49" (1/1) ... [2018-07-25 08:36:49,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:49" (1/1) ... [2018-07-25 08:36:49,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:49" (1/1) ... [2018-07-25 08:36:49,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:49" (1/1) ... [2018-07-25 08:36:49,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:49" (1/1) ... [2018-07-25 08:36:49,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:49" (1/1) ... [2018-07-25 08:36:49,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:36:49,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:36:49,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:36:49,716 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:36:49,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:49" (1/1) ... [2018-07-25 08:36:49,801 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-25 08:36:49,802 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-25 08:36:49,802 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-25 08:36:50,000 INFO L270 CfgBuilder]: Using library mode [2018-07-25 08:36:50,001 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:36:50 BoogieIcfgContainer [2018-07-25 08:36:50,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:36:50,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:36:50,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:36:50,007 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:36:50,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:49" (1/2) ... [2018-07-25 08:36:50,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4848d9fa and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:36:50, skipping insertion in model container [2018-07-25 08:36:50,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:36:50" (2/2) ... [2018-07-25 08:36:50,013 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-07-25 08:36:50,025 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:36:50,034 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-07-25 08:36:50,078 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:36:50,079 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:36:50,079 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:36:50,079 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:36:50,080 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:36:50,080 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:36:50,080 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:36:50,080 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:36:50,080 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:36:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-07-25 08:36:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:36:50,101 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:50,102 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:36:50,104 INFO L415 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:50,109 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-07-25 08:36:50,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:50,200 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:50,200 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:36:50,204 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:36:50,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:36:50,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:36:50,220 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-07-25 08:36:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:50,406 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-07-25 08:36:50,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:36:50,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 08:36:50,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:50,421 INFO L225 Difference]: With dead ends: 32 [2018-07-25 08:36:50,422 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 08:36:50,425 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:50,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 08:36:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-07-25 08:36:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 08:36:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-07-25 08:36:50,486 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-07-25 08:36:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:50,487 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-07-25 08:36:50,487 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:36:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-07-25 08:36:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:36:50,488 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:50,488 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:36:50,489 INFO L415 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:50,489 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-07-25 08:36:50,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:50,542 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:50,543 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:36:50,546 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:36:50,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:36:50,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:36:50,548 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-07-25 08:36:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:50,787 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-07-25 08:36:50,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:36:50,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 08:36:50,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:50,791 INFO L225 Difference]: With dead ends: 38 [2018-07-25 08:36:50,791 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 08:36:50,792 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 08:36:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-07-25 08:36:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 08:36:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-07-25 08:36:50,810 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-07-25 08:36:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:50,811 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-07-25 08:36:50,811 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:36:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-07-25 08:36:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:36:50,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:50,813 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-25 08:36:50,814 INFO L415 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:50,814 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-07-25 08:36:50,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:50,890 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:50,890 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 08:36:50,891 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:36:50,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:36:50,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:50,892 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-07-25 08:36:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:51,051 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-07-25 08:36:51,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:51,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 08:36:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:51,053 INFO L225 Difference]: With dead ends: 43 [2018-07-25 08:36:51,053 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 08:36:51,057 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 08:36:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-07-25 08:36:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:36:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-07-25 08:36:51,088 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-07-25 08:36:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:51,091 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-07-25 08:36:51,091 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:36:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-07-25 08:36:51,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:36:51,092 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:51,092 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-25 08:36:51,092 INFO L415 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:51,093 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-07-25 08:36:51,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:51,129 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:51,129 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 08:36:51,130 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:36:51,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:36:51,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:51,131 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-07-25 08:36:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:51,287 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-07-25 08:36:51,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:36:51,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 08:36:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:51,290 INFO L225 Difference]: With dead ends: 54 [2018-07-25 08:36:51,291 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 08:36:51,294 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 08:36:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-07-25 08:36:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 08:36:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-07-25 08:36:51,321 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-07-25 08:36:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:51,321 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-07-25 08:36:51,324 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:36:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-07-25 08:36:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:51,325 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:51,325 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:51,325 INFO L415 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:51,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-07-25 08:36:51,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:51,408 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:51,408 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:51,409 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:51,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:51,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:51,411 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 8 states. [2018-07-25 08:36:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:51,578 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2018-07-25 08:36:51,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:51,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:36:51,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:51,580 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:36:51,580 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 08:36:51,581 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 08:36:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2018-07-25 08:36:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 08:36:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 100 transitions. [2018-07-25 08:36:51,599 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 100 transitions. Word has length 8 [2018-07-25 08:36:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:51,600 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 100 transitions. [2018-07-25 08:36:51,600 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 100 transitions. [2018-07-25 08:36:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:51,601 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:51,602 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:51,602 INFO L415 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:51,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-07-25 08:36:51,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:51,634 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:51,634 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 08:36:51,634 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:51,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:51,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:51,635 INFO L87 Difference]: Start difference. First operand 59 states and 100 transitions. Second operand 8 states. [2018-07-25 08:36:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:51,772 INFO L93 Difference]: Finished difference Result 92 states and 146 transitions. [2018-07-25 08:36:51,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:51,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:36:51,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:51,774 INFO L225 Difference]: With dead ends: 92 [2018-07-25 08:36:51,774 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 08:36:51,775 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:36:51,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 08:36:51,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2018-07-25 08:36:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 08:36:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 125 transitions. [2018-07-25 08:36:51,806 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 125 transitions. Word has length 8 [2018-07-25 08:36:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:51,808 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 125 transitions. [2018-07-25 08:36:51,809 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 125 transitions. [2018-07-25 08:36:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:51,810 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:51,810 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:51,810 INFO L415 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:51,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-07-25 08:36:51,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:51,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:51,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:51,846 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:51,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:51,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:51,847 INFO L87 Difference]: Start difference. First operand 72 states and 125 transitions. Second operand 8 states. [2018-07-25 08:36:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:52,024 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions. [2018-07-25 08:36:52,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:52,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:36:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:52,026 INFO L225 Difference]: With dead ends: 104 [2018-07-25 08:36:52,026 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 08:36:52,028 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:36:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 08:36:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2018-07-25 08:36:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 08:36:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 135 transitions. [2018-07-25 08:36:52,070 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 135 transitions. Word has length 8 [2018-07-25 08:36:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:52,071 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 135 transitions. [2018-07-25 08:36:52,071 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 135 transitions. [2018-07-25 08:36:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:52,075 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:52,075 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:52,075 INFO L415 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:52,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-07-25 08:36:52,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:52,107 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:52,108 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:52,108 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:52,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:52,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:52,109 INFO L87 Difference]: Start difference. First operand 78 states and 135 transitions. Second operand 8 states. [2018-07-25 08:36:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:52,258 INFO L93 Difference]: Finished difference Result 109 states and 191 transitions. [2018-07-25 08:36:52,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:36:52,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:36:52,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:52,260 INFO L225 Difference]: With dead ends: 109 [2018-07-25 08:36:52,260 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 08:36:52,261 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 08:36:52,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2018-07-25 08:36:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:36:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 144 transitions. [2018-07-25 08:36:52,303 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 144 transitions. Word has length 8 [2018-07-25 08:36:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:52,303 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 144 transitions. [2018-07-25 08:36:52,304 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 144 transitions. [2018-07-25 08:36:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:52,306 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:52,306 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:52,307 INFO L415 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:52,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1965444251, now seen corresponding path program 1 times [2018-07-25 08:36:52,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:52,331 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:52,331 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:36:52,332 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:52,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:52,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:52,332 INFO L87 Difference]: Start difference. First operand 83 states and 144 transitions. Second operand 7 states. [2018-07-25 08:36:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:52,456 INFO L93 Difference]: Finished difference Result 103 states and 166 transitions. [2018-07-25 08:36:52,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:52,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:52,458 INFO L225 Difference]: With dead ends: 103 [2018-07-25 08:36:52,458 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 08:36:52,459 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 08:36:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2018-07-25 08:36:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:36:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 147 transitions. [2018-07-25 08:36:52,495 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 147 transitions. Word has length 8 [2018-07-25 08:36:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:52,496 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 147 transitions. [2018-07-25 08:36:52,496 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 147 transitions. [2018-07-25 08:36:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:52,497 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:52,498 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:52,498 INFO L415 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:52,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-07-25 08:36:52,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:52,525 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:52,525 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:52,526 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:52,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:52,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:52,527 INFO L87 Difference]: Start difference. First operand 85 states and 147 transitions. Second operand 8 states. [2018-07-25 08:36:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:52,706 INFO L93 Difference]: Finished difference Result 103 states and 167 transitions. [2018-07-25 08:36:52,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:52,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:36:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:52,708 INFO L225 Difference]: With dead ends: 103 [2018-07-25 08:36:52,708 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 08:36:52,709 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:36:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 08:36:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2018-07-25 08:36:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:36:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 151 transitions. [2018-07-25 08:36:52,747 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 151 transitions. Word has length 8 [2018-07-25 08:36:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:52,747 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 151 transitions. [2018-07-25 08:36:52,747 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 151 transitions. [2018-07-25 08:36:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:52,748 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:52,750 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:52,751 INFO L415 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-07-25 08:36:52,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:52,783 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:52,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:52,784 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:52,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:52,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:52,785 INFO L87 Difference]: Start difference. First operand 87 states and 151 transitions. Second operand 8 states. [2018-07-25 08:36:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:52,940 INFO L93 Difference]: Finished difference Result 128 states and 210 transitions. [2018-07-25 08:36:52,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:52,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:36:52,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:52,942 INFO L225 Difference]: With dead ends: 128 [2018-07-25 08:36:52,942 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 08:36:52,943 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 08:36:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100. [2018-07-25 08:36:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 08:36:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-07-25 08:36:52,985 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 8 [2018-07-25 08:36:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:52,986 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-07-25 08:36:52,986 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-07-25 08:36:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:52,987 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:52,987 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:52,988 INFO L415 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:52,988 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-07-25 08:36:52,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:53,009 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:53,009 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:36:53,009 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:53,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:53,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:53,011 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 7 states. [2018-07-25 08:36:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:53,157 INFO L93 Difference]: Finished difference Result 136 states and 229 transitions. [2018-07-25 08:36:53,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:53,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:53,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:53,159 INFO L225 Difference]: With dead ends: 136 [2018-07-25 08:36:53,159 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 08:36:53,160 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 08:36:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 102. [2018-07-25 08:36:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 08:36:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 178 transitions. [2018-07-25 08:36:53,205 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 178 transitions. Word has length 8 [2018-07-25 08:36:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:53,206 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 178 transitions. [2018-07-25 08:36:53,206 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 178 transitions. [2018-07-25 08:36:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:53,207 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:53,207 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:53,207 INFO L415 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:53,209 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-07-25 08:36:53,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:53,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:53,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:53,235 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:53,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:53,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:53,236 INFO L87 Difference]: Start difference. First operand 102 states and 178 transitions. Second operand 8 states. [2018-07-25 08:36:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:53,400 INFO L93 Difference]: Finished difference Result 150 states and 251 transitions. [2018-07-25 08:36:53,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:36:53,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:36:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:53,402 INFO L225 Difference]: With dead ends: 150 [2018-07-25 08:36:53,402 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 08:36:53,403 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 08:36:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121. [2018-07-25 08:36:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:36:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2018-07-25 08:36:53,451 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 213 transitions. Word has length 8 [2018-07-25 08:36:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:53,451 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 213 transitions. [2018-07-25 08:36:53,451 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions. [2018-07-25 08:36:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:53,452 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:53,452 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:53,453 INFO L415 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:53,453 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-07-25 08:36:53,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:53,468 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:53,468 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 08:36:53,468 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:53,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:53,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:53,469 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. Second operand 7 states. [2018-07-25 08:36:53,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:53,665 INFO L93 Difference]: Finished difference Result 178 states and 308 transitions. [2018-07-25 08:36:53,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:53,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:53,667 INFO L225 Difference]: With dead ends: 178 [2018-07-25 08:36:53,668 INFO L226 Difference]: Without dead ends: 176 [2018-07-25 08:36:53,668 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:36:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-25 08:36:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 132. [2018-07-25 08:36:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 08:36:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 233 transitions. [2018-07-25 08:36:53,725 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 233 transitions. Word has length 8 [2018-07-25 08:36:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:53,726 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 233 transitions. [2018-07-25 08:36:53,726 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 233 transitions. [2018-07-25 08:36:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:53,727 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:53,727 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:53,727 INFO L415 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-07-25 08:36:53,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:53,744 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:53,744 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:36:53,745 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:53,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:53,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:53,745 INFO L87 Difference]: Start difference. First operand 132 states and 233 transitions. Second operand 7 states. [2018-07-25 08:36:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:53,945 INFO L93 Difference]: Finished difference Result 235 states and 413 transitions. [2018-07-25 08:36:53,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:53,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:53,948 INFO L225 Difference]: With dead ends: 235 [2018-07-25 08:36:53,948 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 08:36:53,949 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 08:36:54,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 179. [2018-07-25 08:36:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 08:36:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 320 transitions. [2018-07-25 08:36:54,035 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 320 transitions. Word has length 8 [2018-07-25 08:36:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:54,035 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 320 transitions. [2018-07-25 08:36:54,035 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 320 transitions. [2018-07-25 08:36:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:36:54,036 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:54,036 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:36:54,037 INFO L415 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:54,037 INFO L82 PathProgramCache]: Analyzing trace with hash -799219888, now seen corresponding path program 1 times [2018-07-25 08:36:54,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:54,071 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:54,071 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:54,072 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:54,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:54,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:54,073 INFO L87 Difference]: Start difference. First operand 179 states and 320 transitions. Second operand 8 states. [2018-07-25 08:36:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:54,275 INFO L93 Difference]: Finished difference Result 206 states and 368 transitions. [2018-07-25 08:36:54,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:54,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-07-25 08:36:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:54,277 INFO L225 Difference]: With dead ends: 206 [2018-07-25 08:36:54,277 INFO L226 Difference]: Without dead ends: 204 [2018-07-25 08:36:54,278 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:36:54,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-07-25 08:36:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2018-07-25 08:36:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-25 08:36:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 351 transitions. [2018-07-25 08:36:54,395 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 351 transitions. Word has length 9 [2018-07-25 08:36:54,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:54,395 INFO L472 AbstractCegarLoop]: Abstraction has 196 states and 351 transitions. [2018-07-25 08:36:54,396 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 351 transitions. [2018-07-25 08:36:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:36:54,396 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:54,397 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:54,397 INFO L415 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:54,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1170716006, now seen corresponding path program 1 times [2018-07-25 08:36:54,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:54,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:54,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:54,428 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:54,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:54,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:54,429 INFO L87 Difference]: Start difference. First operand 196 states and 351 transitions. Second operand 9 states. [2018-07-25 08:36:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:54,726 INFO L93 Difference]: Finished difference Result 266 states and 466 transitions. [2018-07-25 08:36:54,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:36:54,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 08:36:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:54,729 INFO L225 Difference]: With dead ends: 266 [2018-07-25 08:36:54,729 INFO L226 Difference]: Without dead ends: 264 [2018-07-25 08:36:54,730 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:36:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-07-25 08:36:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 222. [2018-07-25 08:36:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-07-25 08:36:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 402 transitions. [2018-07-25 08:36:54,821 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 402 transitions. Word has length 9 [2018-07-25 08:36:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:54,821 INFO L472 AbstractCegarLoop]: Abstraction has 222 states and 402 transitions. [2018-07-25 08:36:54,821 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 402 transitions. [2018-07-25 08:36:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:54,822 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:54,822 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:54,823 INFO L415 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:54,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-07-25 08:36:54,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:54,837 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:54,837 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:54,837 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:54,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:54,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:54,838 INFO L87 Difference]: Start difference. First operand 222 states and 402 transitions. Second operand 7 states. [2018-07-25 08:36:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:55,024 INFO L93 Difference]: Finished difference Result 264 states and 459 transitions. [2018-07-25 08:36:55,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:55,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 08:36:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:55,027 INFO L225 Difference]: With dead ends: 264 [2018-07-25 08:36:55,027 INFO L226 Difference]: Without dead ends: 262 [2018-07-25 08:36:55,028 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:36:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-07-25 08:36:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 231. [2018-07-25 08:36:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 08:36:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 420 transitions. [2018-07-25 08:36:55,122 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 420 transitions. Word has length 11 [2018-07-25 08:36:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:55,123 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 420 transitions. [2018-07-25 08:36:55,123 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 420 transitions. [2018-07-25 08:36:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:55,124 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:55,124 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:55,124 INFO L415 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000296, now seen corresponding path program 1 times [2018-07-25 08:36:55,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:55,145 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:55,145 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:55,146 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:55,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:55,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:55,148 INFO L87 Difference]: Start difference. First operand 231 states and 420 transitions. Second operand 9 states. [2018-07-25 08:36:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:55,307 INFO L93 Difference]: Finished difference Result 250 states and 439 transitions. [2018-07-25 08:36:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:55,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-25 08:36:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:55,311 INFO L225 Difference]: With dead ends: 250 [2018-07-25 08:36:55,311 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 08:36:55,312 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 08:36:55,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2018-07-25 08:36:55,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 08:36:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 419 transitions. [2018-07-25 08:36:55,404 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 419 transitions. Word has length 11 [2018-07-25 08:36:55,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:55,404 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 419 transitions. [2018-07-25 08:36:55,404 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 419 transitions. [2018-07-25 08:36:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:55,405 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:55,405 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:55,406 INFO L415 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:55,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-07-25 08:36:55,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:55,432 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:55,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:55,433 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:55,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:55,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:55,434 INFO L87 Difference]: Start difference. First operand 231 states and 419 transitions. Second operand 9 states. [2018-07-25 08:36:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:55,706 INFO L93 Difference]: Finished difference Result 278 states and 490 transitions. [2018-07-25 08:36:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:55,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-25 08:36:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:55,709 INFO L225 Difference]: With dead ends: 278 [2018-07-25 08:36:55,709 INFO L226 Difference]: Without dead ends: 276 [2018-07-25 08:36:55,710 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:36:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-07-25 08:36:55,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 242. [2018-07-25 08:36:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-07-25 08:36:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 439 transitions. [2018-07-25 08:36:55,805 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 439 transitions. Word has length 11 [2018-07-25 08:36:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:55,806 INFO L472 AbstractCegarLoop]: Abstraction has 242 states and 439 transitions. [2018-07-25 08:36:55,806 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 439 transitions. [2018-07-25 08:36:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:55,806 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:55,807 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:55,807 INFO L415 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash 707062982, now seen corresponding path program 2 times [2018-07-25 08:36:55,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:55,822 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:55,822 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:55,822 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:55,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:55,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:55,823 INFO L87 Difference]: Start difference. First operand 242 states and 439 transitions. Second operand 7 states. [2018-07-25 08:36:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:56,000 INFO L93 Difference]: Finished difference Result 300 states and 527 transitions. [2018-07-25 08:36:56,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:56,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 08:36:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:56,003 INFO L225 Difference]: With dead ends: 300 [2018-07-25 08:36:56,003 INFO L226 Difference]: Without dead ends: 298 [2018-07-25 08:36:56,004 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-07-25 08:36:56,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 267. [2018-07-25 08:36:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 08:36:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 484 transitions. [2018-07-25 08:36:56,105 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 484 transitions. Word has length 11 [2018-07-25 08:36:56,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:56,105 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 484 transitions. [2018-07-25 08:36:56,105 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 484 transitions. [2018-07-25 08:36:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:56,106 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:56,106 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:56,107 INFO L415 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:56,107 INFO L82 PathProgramCache]: Analyzing trace with hash 707063270, now seen corresponding path program 2 times [2018-07-25 08:36:56,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:56,129 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:56,129 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:56,130 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:56,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:56,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:56,131 INFO L87 Difference]: Start difference. First operand 267 states and 484 transitions. Second operand 9 states. [2018-07-25 08:36:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:56,371 INFO L93 Difference]: Finished difference Result 334 states and 589 transitions. [2018-07-25 08:36:56,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:56,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-25 08:36:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:56,376 INFO L225 Difference]: With dead ends: 334 [2018-07-25 08:36:56,376 INFO L226 Difference]: Without dead ends: 333 [2018-07-25 08:36:56,377 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:36:56,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-07-25 08:36:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 282. [2018-07-25 08:36:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-07-25 08:36:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 512 transitions. [2018-07-25 08:36:56,482 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 512 transitions. Word has length 11 [2018-07-25 08:36:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:56,482 INFO L472 AbstractCegarLoop]: Abstraction has 282 states and 512 transitions. [2018-07-25 08:36:56,482 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 512 transitions. [2018-07-25 08:36:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:56,483 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:56,483 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:56,483 INFO L415 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:56,484 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-07-25 08:36:56,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:56,504 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:56,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:56,504 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:56,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:56,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:56,505 INFO L87 Difference]: Start difference. First operand 282 states and 512 transitions. Second operand 8 states. [2018-07-25 08:36:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:56,797 INFO L93 Difference]: Finished difference Result 342 states and 604 transitions. [2018-07-25 08:36:56,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:36:56,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-07-25 08:36:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:56,800 INFO L225 Difference]: With dead ends: 342 [2018-07-25 08:36:56,800 INFO L226 Difference]: Without dead ends: 340 [2018-07-25 08:36:56,801 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:36:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-07-25 08:36:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2018-07-25 08:36:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-07-25 08:36:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 518 transitions. [2018-07-25 08:36:56,967 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 518 transitions. Word has length 11 [2018-07-25 08:36:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:56,967 INFO L472 AbstractCegarLoop]: Abstraction has 286 states and 518 transitions. [2018-07-25 08:36:56,967 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 518 transitions. [2018-07-25 08:36:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:56,968 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:56,969 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:56,969 INFO L415 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:56,969 INFO L82 PathProgramCache]: Analyzing trace with hash 285598401, now seen corresponding path program 1 times [2018-07-25 08:36:56,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:56,998 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:56,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:56,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:56,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:56,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:56,999 INFO L87 Difference]: Start difference. First operand 286 states and 518 transitions. Second operand 9 states. [2018-07-25 08:36:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:57,339 INFO L93 Difference]: Finished difference Result 300 states and 532 transitions. [2018-07-25 08:36:57,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:57,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-25 08:36:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:57,344 INFO L225 Difference]: With dead ends: 300 [2018-07-25 08:36:57,344 INFO L226 Difference]: Without dead ends: 298 [2018-07-25 08:36:57,345 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:36:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-07-25 08:36:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 251. [2018-07-25 08:36:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 08:36:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 450 transitions. [2018-07-25 08:36:57,451 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 450 transitions. Word has length 11 [2018-07-25 08:36:57,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:57,452 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 450 transitions. [2018-07-25 08:36:57,452 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 450 transitions. [2018-07-25 08:36:57,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:57,453 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:57,453 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:57,454 INFO L415 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:57,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-07-25 08:36:57,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:57,480 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:57,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:57,480 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:57,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:57,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:57,481 INFO L87 Difference]: Start difference. First operand 251 states and 450 transitions. Second operand 8 states. [2018-07-25 08:36:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:57,694 INFO L93 Difference]: Finished difference Result 286 states and 493 transitions. [2018-07-25 08:36:57,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:57,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-07-25 08:36:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:57,696 INFO L225 Difference]: With dead ends: 286 [2018-07-25 08:36:57,696 INFO L226 Difference]: Without dead ends: 284 [2018-07-25 08:36:57,697 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:36:57,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-07-25 08:36:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 257. [2018-07-25 08:36:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-25 08:36:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 460 transitions. [2018-07-25 08:36:57,812 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 460 transitions. Word has length 11 [2018-07-25 08:36:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:57,812 INFO L472 AbstractCegarLoop]: Abstraction has 257 states and 460 transitions. [2018-07-25 08:36:57,812 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 460 transitions. [2018-07-25 08:36:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:57,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:57,813 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:57,813 INFO L415 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-07-25 08:36:57,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:57,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:57,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:57,826 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:57,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:57,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:57,827 INFO L87 Difference]: Start difference. First operand 257 states and 460 transitions. Second operand 7 states. [2018-07-25 08:36:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:58,023 INFO L93 Difference]: Finished difference Result 292 states and 503 transitions. [2018-07-25 08:36:58,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:58,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 08:36:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:58,026 INFO L225 Difference]: With dead ends: 292 [2018-07-25 08:36:58,026 INFO L226 Difference]: Without dead ends: 290 [2018-07-25 08:36:58,027 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:58,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-07-25 08:36:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 256. [2018-07-25 08:36:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-07-25 08:36:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 458 transitions. [2018-07-25 08:36:58,133 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 458 transitions. Word has length 11 [2018-07-25 08:36:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:58,134 INFO L472 AbstractCegarLoop]: Abstraction has 256 states and 458 transitions. [2018-07-25 08:36:58,134 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 458 transitions. [2018-07-25 08:36:58,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:58,134 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:58,135 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:58,135 INFO L415 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:58,135 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-07-25 08:36:58,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:58,147 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:58,147 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:58,147 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:58,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:58,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:58,148 INFO L87 Difference]: Start difference. First operand 256 states and 458 transitions. Second operand 7 states. [2018-07-25 08:36:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:58,392 INFO L93 Difference]: Finished difference Result 320 states and 559 transitions. [2018-07-25 08:36:58,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:36:58,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 08:36:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:58,395 INFO L225 Difference]: With dead ends: 320 [2018-07-25 08:36:58,395 INFO L226 Difference]: Without dead ends: 318 [2018-07-25 08:36:58,395 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:36:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-07-25 08:36:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 281. [2018-07-25 08:36:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-25 08:36:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 503 transitions. [2018-07-25 08:36:58,505 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 503 transitions. Word has length 11 [2018-07-25 08:36:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:58,506 INFO L472 AbstractCegarLoop]: Abstraction has 281 states and 503 transitions. [2018-07-25 08:36:58,506 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 503 transitions. [2018-07-25 08:36:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:58,507 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:58,507 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:58,507 INFO L415 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:58,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-07-25 08:36:58,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:58,518 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:58,518 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:58,519 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:58,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:58,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:58,519 INFO L87 Difference]: Start difference. First operand 281 states and 503 transitions. Second operand 7 states. [2018-07-25 08:36:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:58,772 INFO L93 Difference]: Finished difference Result 333 states and 581 transitions. [2018-07-25 08:36:58,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:58,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 08:36:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:58,775 INFO L225 Difference]: With dead ends: 333 [2018-07-25 08:36:58,775 INFO L226 Difference]: Without dead ends: 331 [2018-07-25 08:36:58,776 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-25 08:36:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 285. [2018-07-25 08:36:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-25 08:36:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 510 transitions. [2018-07-25 08:36:58,895 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 510 transitions. Word has length 11 [2018-07-25 08:36:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:58,896 INFO L472 AbstractCegarLoop]: Abstraction has 285 states and 510 transitions. [2018-07-25 08:36:58,896 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:58,896 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 510 transitions. [2018-07-25 08:36:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:58,897 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:58,897 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:58,897 INFO L415 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:58,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-07-25 08:36:58,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:58,909 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:58,909 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:58,909 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:58,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:58,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:58,910 INFO L87 Difference]: Start difference. First operand 285 states and 510 transitions. Second operand 7 states. [2018-07-25 08:36:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:59,179 INFO L93 Difference]: Finished difference Result 353 states and 620 transitions. [2018-07-25 08:36:59,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:36:59,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 08:36:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:59,181 INFO L225 Difference]: With dead ends: 353 [2018-07-25 08:36:59,181 INFO L226 Difference]: Without dead ends: 351 [2018-07-25 08:36:59,182 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:36:59,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-07-25 08:36:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 306. [2018-07-25 08:36:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-07-25 08:36:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 547 transitions. [2018-07-25 08:36:59,310 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 547 transitions. Word has length 11 [2018-07-25 08:36:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:59,311 INFO L472 AbstractCegarLoop]: Abstraction has 306 states and 547 transitions. [2018-07-25 08:36:59,311 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 547 transitions. [2018-07-25 08:36:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:59,312 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:59,312 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:59,312 INFO L415 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-07-25 08:36:59,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:59,328 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:59,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:59,328 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:59,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:59,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:59,329 INFO L87 Difference]: Start difference. First operand 306 states and 547 transitions. Second operand 7 states. [2018-07-25 08:36:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:59,593 INFO L93 Difference]: Finished difference Result 331 states and 575 transitions. [2018-07-25 08:36:59,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:59,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 08:36:59,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:59,596 INFO L225 Difference]: With dead ends: 331 [2018-07-25 08:36:59,597 INFO L226 Difference]: Without dead ends: 329 [2018-07-25 08:36:59,598 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-07-25 08:36:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 300. [2018-07-25 08:36:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-07-25 08:36:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 534 transitions. [2018-07-25 08:36:59,750 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 534 transitions. Word has length 11 [2018-07-25 08:36:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:59,751 INFO L472 AbstractCegarLoop]: Abstraction has 300 states and 534 transitions. [2018-07-25 08:36:59,751 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 534 transitions. [2018-07-25 08:36:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:36:59,752 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:59,752 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:59,752 INFO L415 AbstractCegarLoop]: === Iteration 31 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:59,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-07-25 08:36:59,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:59,767 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:59,767 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:59,767 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:59,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:59,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:59,769 INFO L87 Difference]: Start difference. First operand 300 states and 534 transitions. Second operand 7 states. [2018-07-25 08:37:00,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:00,087 INFO L93 Difference]: Finished difference Result 354 states and 618 transitions. [2018-07-25 08:37:00,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:37:00,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 08:37:00,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:00,089 INFO L225 Difference]: With dead ends: 354 [2018-07-25 08:37:00,090 INFO L226 Difference]: Without dead ends: 352 [2018-07-25 08:37:00,091 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-07-25 08:37:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 286. [2018-07-25 08:37:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-07-25 08:37:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 510 transitions. [2018-07-25 08:37:00,210 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 510 transitions. Word has length 11 [2018-07-25 08:37:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:00,210 INFO L472 AbstractCegarLoop]: Abstraction has 286 states and 510 transitions. [2018-07-25 08:37:00,210 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:37:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 510 transitions. [2018-07-25 08:37:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:37:00,211 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:00,211 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:00,211 INFO L415 AbstractCegarLoop]: === Iteration 32 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-07-25 08:37:00,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:00,227 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:00,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:37:00,227 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:37:00,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:37:00,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:37:00,228 INFO L87 Difference]: Start difference. First operand 286 states and 510 transitions. Second operand 7 states. [2018-07-25 08:37:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:00,459 INFO L93 Difference]: Finished difference Result 344 states and 601 transitions. [2018-07-25 08:37:00,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:37:00,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-25 08:37:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:00,462 INFO L225 Difference]: With dead ends: 344 [2018-07-25 08:37:00,462 INFO L226 Difference]: Without dead ends: 342 [2018-07-25 08:37:00,463 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:37:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-07-25 08:37:00,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 279. [2018-07-25 08:37:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-25 08:37:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 496 transitions. [2018-07-25 08:37:00,581 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 496 transitions. Word has length 11 [2018-07-25 08:37:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:00,583 INFO L472 AbstractCegarLoop]: Abstraction has 279 states and 496 transitions. [2018-07-25 08:37:00,583 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:37:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 496 transitions. [2018-07-25 08:37:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:37:00,584 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:00,584 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:00,585 INFO L415 AbstractCegarLoop]: === Iteration 33 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1894600283, now seen corresponding path program 1 times [2018-07-25 08:37:00,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:00,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:00,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:00,609 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:37:00,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:37:00,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:37:00,610 INFO L87 Difference]: Start difference. First operand 279 states and 496 transitions. Second operand 7 states. [2018-07-25 08:37:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:00,866 INFO L93 Difference]: Finished difference Result 634 states and 1102 transitions. [2018-07-25 08:37:00,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:37:00,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 08:37:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:00,869 INFO L225 Difference]: With dead ends: 634 [2018-07-25 08:37:00,869 INFO L226 Difference]: Without dead ends: 356 [2018-07-25 08:37:00,872 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:00,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-07-25 08:37:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 339. [2018-07-25 08:37:01,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-07-25 08:37:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 589 transitions. [2018-07-25 08:37:01,013 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 589 transitions. Word has length 12 [2018-07-25 08:37:01,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:01,014 INFO L472 AbstractCegarLoop]: Abstraction has 339 states and 589 transitions. [2018-07-25 08:37:01,014 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:37:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 589 transitions. [2018-07-25 08:37:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:37:01,014 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:01,015 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:01,015 INFO L415 AbstractCegarLoop]: === Iteration 34 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1217022044, now seen corresponding path program 1 times [2018-07-25 08:37:01,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:01,037 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:01,037 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:01,037 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:37:01,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:37:01,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:37:01,038 INFO L87 Difference]: Start difference. First operand 339 states and 589 transitions. Second operand 9 states. [2018-07-25 08:37:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:01,340 INFO L93 Difference]: Finished difference Result 433 states and 739 transitions. [2018-07-25 08:37:01,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:37:01,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:37:01,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:01,342 INFO L225 Difference]: With dead ends: 433 [2018-07-25 08:37:01,343 INFO L226 Difference]: Without dead ends: 431 [2018-07-25 08:37:01,343 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:37:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-07-25 08:37:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 396. [2018-07-25 08:37:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-07-25 08:37:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 693 transitions. [2018-07-25 08:37:01,530 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 693 transitions. Word has length 12 [2018-07-25 08:37:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:01,530 INFO L472 AbstractCegarLoop]: Abstraction has 396 states and 693 transitions. [2018-07-25 08:37:01,530 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:37:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 693 transitions. [2018-07-25 08:37:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:37:01,531 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:01,531 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:01,531 INFO L415 AbstractCegarLoop]: === Iteration 35 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1730496441, now seen corresponding path program 2 times [2018-07-25 08:37:01,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:01,549 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:01,549 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:01,549 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:37:01,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:37:01,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:37:01,550 INFO L87 Difference]: Start difference. First operand 396 states and 693 transitions. Second operand 7 states. [2018-07-25 08:37:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:01,903 INFO L93 Difference]: Finished difference Result 897 states and 1547 transitions. [2018-07-25 08:37:01,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:37:01,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 08:37:01,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:01,906 INFO L225 Difference]: With dead ends: 897 [2018-07-25 08:37:01,907 INFO L226 Difference]: Without dead ends: 502 [2018-07-25 08:37:01,908 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-07-25 08:37:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 435. [2018-07-25 08:37:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-07-25 08:37:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 751 transitions. [2018-07-25 08:37:02,127 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 751 transitions. Word has length 12 [2018-07-25 08:37:02,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:02,128 INFO L472 AbstractCegarLoop]: Abstraction has 435 states and 751 transitions. [2018-07-25 08:37:02,128 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:37:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 751 transitions. [2018-07-25 08:37:02,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:37:02,129 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:02,129 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:02,129 INFO L415 AbstractCegarLoop]: === Iteration 36 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:02,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-07-25 08:37:02,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:02,153 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:02,153 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:02,153 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:37:02,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:37:02,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:37:02,154 INFO L87 Difference]: Start difference. First operand 435 states and 751 transitions. Second operand 9 states. [2018-07-25 08:37:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:02,497 INFO L93 Difference]: Finished difference Result 481 states and 818 transitions. [2018-07-25 08:37:02,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:37:02,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:37:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:02,500 INFO L225 Difference]: With dead ends: 481 [2018-07-25 08:37:02,500 INFO L226 Difference]: Without dead ends: 479 [2018-07-25 08:37:02,501 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:37:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-07-25 08:37:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 444. [2018-07-25 08:37:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-07-25 08:37:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 764 transitions. [2018-07-25 08:37:02,730 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 764 transitions. Word has length 12 [2018-07-25 08:37:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:02,731 INFO L472 AbstractCegarLoop]: Abstraction has 444 states and 764 transitions. [2018-07-25 08:37:02,731 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:37:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 764 transitions. [2018-07-25 08:37:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:37:02,732 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:02,732 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:02,732 INFO L415 AbstractCegarLoop]: === Iteration 37 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:02,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-07-25 08:37:02,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:02,753 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:02,753 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:02,753 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:37:02,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:37:02,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:37:02,754 INFO L87 Difference]: Start difference. First operand 444 states and 764 transitions. Second operand 9 states. [2018-07-25 08:37:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:03,192 INFO L93 Difference]: Finished difference Result 515 states and 880 transitions. [2018-07-25 08:37:03,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:37:03,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:37:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:03,195 INFO L225 Difference]: With dead ends: 515 [2018-07-25 08:37:03,195 INFO L226 Difference]: Without dead ends: 513 [2018-07-25 08:37:03,196 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:37:03,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-07-25 08:37:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 468. [2018-07-25 08:37:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-07-25 08:37:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 808 transitions. [2018-07-25 08:37:03,398 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 808 transitions. Word has length 12 [2018-07-25 08:37:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:03,398 INFO L472 AbstractCegarLoop]: Abstraction has 468 states and 808 transitions. [2018-07-25 08:37:03,400 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:37:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 808 transitions. [2018-07-25 08:37:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:37:03,401 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:03,401 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:03,401 INFO L415 AbstractCegarLoop]: === Iteration 38 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:03,401 INFO L82 PathProgramCache]: Analyzing trace with hash -317442274, now seen corresponding path program 1 times [2018-07-25 08:37:03,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:03,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:03,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:03,428 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:37:03,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:37:03,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:37:03,429 INFO L87 Difference]: Start difference. First operand 468 states and 808 transitions. Second operand 9 states. [2018-07-25 08:37:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:03,885 INFO L93 Difference]: Finished difference Result 550 states and 930 transitions. [2018-07-25 08:37:03,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:37:03,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:37:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:03,888 INFO L225 Difference]: With dead ends: 550 [2018-07-25 08:37:03,888 INFO L226 Difference]: Without dead ends: 548 [2018-07-25 08:37:03,889 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:37:03,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-07-25 08:37:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 483. [2018-07-25 08:37:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-07-25 08:37:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 836 transitions. [2018-07-25 08:37:04,121 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 836 transitions. Word has length 13 [2018-07-25 08:37:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:04,121 INFO L472 AbstractCegarLoop]: Abstraction has 483 states and 836 transitions. [2018-07-25 08:37:04,121 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:37:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 836 transitions. [2018-07-25 08:37:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:37:04,122 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:04,122 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:04,123 INFO L415 AbstractCegarLoop]: === Iteration 39 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-07-25 08:37:04,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:04,136 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:04,137 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:04,137 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:04,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:04,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:04,138 INFO L87 Difference]: Start difference. First operand 483 states and 836 transitions. Second operand 8 states. [2018-07-25 08:37:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:04,461 INFO L93 Difference]: Finished difference Result 528 states and 903 transitions. [2018-07-25 08:37:04,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:37:04,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 08:37:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:04,464 INFO L225 Difference]: With dead ends: 528 [2018-07-25 08:37:04,464 INFO L226 Difference]: Without dead ends: 526 [2018-07-25 08:37:04,465 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:37:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-07-25 08:37:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 487. [2018-07-25 08:37:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-07-25 08:37:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 842 transitions. [2018-07-25 08:37:04,719 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 842 transitions. Word has length 14 [2018-07-25 08:37:04,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:04,719 INFO L472 AbstractCegarLoop]: Abstraction has 487 states and 842 transitions. [2018-07-25 08:37:04,719 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 842 transitions. [2018-07-25 08:37:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:37:04,721 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:04,721 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:04,721 INFO L415 AbstractCegarLoop]: === Iteration 40 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:04,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-07-25 08:37:04,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:04,740 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:04,740 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:04,740 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:04,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:04,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:04,741 INFO L87 Difference]: Start difference. First operand 487 states and 842 transitions. Second operand 8 states. [2018-07-25 08:37:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:05,162 INFO L93 Difference]: Finished difference Result 562 states and 960 transitions. [2018-07-25 08:37:05,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:37:05,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 08:37:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:05,166 INFO L225 Difference]: With dead ends: 562 [2018-07-25 08:37:05,166 INFO L226 Difference]: Without dead ends: 560 [2018-07-25 08:37:05,166 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:37:05,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-07-25 08:37:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 487. [2018-07-25 08:37:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-07-25 08:37:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 842 transitions. [2018-07-25 08:37:05,376 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 842 transitions. Word has length 14 [2018-07-25 08:37:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:05,376 INFO L472 AbstractCegarLoop]: Abstraction has 487 states and 842 transitions. [2018-07-25 08:37:05,377 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 842 transitions. [2018-07-25 08:37:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:37:05,378 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:05,378 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:05,378 INFO L415 AbstractCegarLoop]: === Iteration 41 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:05,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1602335980, now seen corresponding path program 3 times [2018-07-25 08:37:05,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:05,389 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:05,390 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:05,390 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:05,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:05,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:05,391 INFO L87 Difference]: Start difference. First operand 487 states and 842 transitions. Second operand 8 states. [2018-07-25 08:37:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:05,772 INFO L93 Difference]: Finished difference Result 554 states and 945 transitions. [2018-07-25 08:37:05,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:37:05,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 08:37:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:05,775 INFO L225 Difference]: With dead ends: 554 [2018-07-25 08:37:05,775 INFO L226 Difference]: Without dead ends: 552 [2018-07-25 08:37:05,776 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:37:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-07-25 08:37:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 481. [2018-07-25 08:37:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-07-25 08:37:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 832 transitions. [2018-07-25 08:37:05,972 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 832 transitions. Word has length 14 [2018-07-25 08:37:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:05,973 INFO L472 AbstractCegarLoop]: Abstraction has 481 states and 832 transitions. [2018-07-25 08:37:05,973 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:05,973 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 832 transitions. [2018-07-25 08:37:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:37:05,974 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:05,974 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:05,974 INFO L415 AbstractCegarLoop]: === Iteration 42 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:05,974 INFO L82 PathProgramCache]: Analyzing trace with hash -245567750, now seen corresponding path program 4 times [2018-07-25 08:37:05,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:05,986 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:05,986 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:05,986 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:05,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:05,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:05,987 INFO L87 Difference]: Start difference. First operand 481 states and 832 transitions. Second operand 8 states. [2018-07-25 08:37:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:06,336 INFO L93 Difference]: Finished difference Result 547 states and 937 transitions. [2018-07-25 08:37:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:37:06,336 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 08:37:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:06,339 INFO L225 Difference]: With dead ends: 547 [2018-07-25 08:37:06,339 INFO L226 Difference]: Without dead ends: 545 [2018-07-25 08:37:06,340 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:37:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-07-25 08:37:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 488. [2018-07-25 08:37:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-07-25 08:37:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 844 transitions. [2018-07-25 08:37:06,549 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 844 transitions. Word has length 14 [2018-07-25 08:37:06,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:06,549 INFO L472 AbstractCegarLoop]: Abstraction has 488 states and 844 transitions. [2018-07-25 08:37:06,549 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 844 transitions. [2018-07-25 08:37:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:37:06,550 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:06,550 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:06,551 INFO L415 AbstractCegarLoop]: === Iteration 43 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:06,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-07-25 08:37:06,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:06,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:06,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:06,567 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:37:06,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:37:06,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:37:06,568 INFO L87 Difference]: Start difference. First operand 488 states and 844 transitions. Second operand 9 states. [2018-07-25 08:37:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:06,909 INFO L93 Difference]: Finished difference Result 545 states and 922 transitions. [2018-07-25 08:37:06,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:37:06,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-07-25 08:37:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:06,912 INFO L225 Difference]: With dead ends: 545 [2018-07-25 08:37:06,912 INFO L226 Difference]: Without dead ends: 543 [2018-07-25 08:37:06,913 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:37:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-07-25 08:37:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 473. [2018-07-25 08:37:07,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-07-25 08:37:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 820 transitions. [2018-07-25 08:37:07,159 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 820 transitions. Word has length 14 [2018-07-25 08:37:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:07,159 INFO L472 AbstractCegarLoop]: Abstraction has 473 states and 820 transitions. [2018-07-25 08:37:07,159 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:37:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 820 transitions. [2018-07-25 08:37:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:37:07,161 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:07,161 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:07,161 INFO L415 AbstractCegarLoop]: === Iteration 44 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:07,161 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-07-25 08:37:07,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:07,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:07,174 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:07,174 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:07,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:07,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:07,175 INFO L87 Difference]: Start difference. First operand 473 states and 820 transitions. Second operand 8 states. [2018-07-25 08:37:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:07,564 INFO L93 Difference]: Finished difference Result 535 states and 908 transitions. [2018-07-25 08:37:07,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:37:07,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 08:37:07,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:07,568 INFO L225 Difference]: With dead ends: 535 [2018-07-25 08:37:07,568 INFO L226 Difference]: Without dead ends: 533 [2018-07-25 08:37:07,569 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-07-25 08:37:07,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 469. [2018-07-25 08:37:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-07-25 08:37:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 814 transitions. [2018-07-25 08:37:07,810 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 814 transitions. Word has length 14 [2018-07-25 08:37:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:07,810 INFO L472 AbstractCegarLoop]: Abstraction has 469 states and 814 transitions. [2018-07-25 08:37:07,810 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 814 transitions. [2018-07-25 08:37:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:07,811 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:07,811 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:07,811 INFO L415 AbstractCegarLoop]: === Iteration 45 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1810259450, now seen corresponding path program 1 times [2018-07-25 08:37:07,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:07,831 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:07,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:07,832 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:37:07,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:37:07,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:37:07,832 INFO L87 Difference]: Start difference. First operand 469 states and 814 transitions. Second operand 9 states. [2018-07-25 08:37:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:08,393 INFO L93 Difference]: Finished difference Result 1268 states and 2153 transitions. [2018-07-25 08:37:08,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:37:08,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-07-25 08:37:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:08,398 INFO L225 Difference]: With dead ends: 1268 [2018-07-25 08:37:08,398 INFO L226 Difference]: Without dead ends: 764 [2018-07-25 08:37:08,399 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:37:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-07-25 08:37:08,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 651. [2018-07-25 08:37:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-07-25 08:37:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1121 transitions. [2018-07-25 08:37:08,725 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1121 transitions. Word has length 15 [2018-07-25 08:37:08,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:08,725 INFO L472 AbstractCegarLoop]: Abstraction has 651 states and 1121 transitions. [2018-07-25 08:37:08,725 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:37:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1121 transitions. [2018-07-25 08:37:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:08,726 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:08,726 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:08,726 INFO L415 AbstractCegarLoop]: === Iteration 46 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:08,727 INFO L82 PathProgramCache]: Analyzing trace with hash 765271427, now seen corresponding path program 1 times [2018-07-25 08:37:08,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:08,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:08,761 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:08,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:08,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:08,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:08,762 INFO L87 Difference]: Start difference. First operand 651 states and 1121 transitions. Second operand 8 states. [2018-07-25 08:37:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:09,410 INFO L93 Difference]: Finished difference Result 1561 states and 2653 transitions. [2018-07-25 08:37:09,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:37:09,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-07-25 08:37:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:09,415 INFO L225 Difference]: With dead ends: 1561 [2018-07-25 08:37:09,416 INFO L226 Difference]: Without dead ends: 911 [2018-07-25 08:37:09,417 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:37:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-07-25 08:37:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 651. [2018-07-25 08:37:09,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-07-25 08:37:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1114 transitions. [2018-07-25 08:37:09,769 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1114 transitions. Word has length 15 [2018-07-25 08:37:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:09,769 INFO L472 AbstractCegarLoop]: Abstraction has 651 states and 1114 transitions. [2018-07-25 08:37:09,769 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1114 transitions. [2018-07-25 08:37:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:09,771 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:09,771 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:09,771 INFO L415 AbstractCegarLoop]: === Iteration 47 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:09,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1161913671, now seen corresponding path program 1 times [2018-07-25 08:37:09,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:09,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:09,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:09,793 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:09,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:09,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:09,794 INFO L87 Difference]: Start difference. First operand 651 states and 1114 transitions. Second operand 10 states. [2018-07-25 08:37:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:10,341 INFO L93 Difference]: Finished difference Result 756 states and 1259 transitions. [2018-07-25 08:37:10,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:37:10,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:37:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:10,346 INFO L225 Difference]: With dead ends: 756 [2018-07-25 08:37:10,346 INFO L226 Difference]: Without dead ends: 754 [2018-07-25 08:37:10,346 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:37:10,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-07-25 08:37:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 687. [2018-07-25 08:37:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-07-25 08:37:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1172 transitions. [2018-07-25 08:37:10,750 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1172 transitions. Word has length 15 [2018-07-25 08:37:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:10,751 INFO L472 AbstractCegarLoop]: Abstraction has 687 states and 1172 transitions. [2018-07-25 08:37:10,751 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1172 transitions. [2018-07-25 08:37:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:10,752 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:10,752 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:10,752 INFO L415 AbstractCegarLoop]: === Iteration 48 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:10,752 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-07-25 08:37:10,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:10,769 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:10,769 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:10,770 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:10,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:10,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:10,771 INFO L87 Difference]: Start difference. First operand 687 states and 1172 transitions. Second operand 10 states. [2018-07-25 08:37:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:11,335 INFO L93 Difference]: Finished difference Result 826 states and 1381 transitions. [2018-07-25 08:37:11,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:37:11,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:37:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:11,339 INFO L225 Difference]: With dead ends: 826 [2018-07-25 08:37:11,339 INFO L226 Difference]: Without dead ends: 824 [2018-07-25 08:37:11,340 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:37:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2018-07-25 08:37:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 720. [2018-07-25 08:37:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-07-25 08:37:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1226 transitions. [2018-07-25 08:37:11,752 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1226 transitions. Word has length 15 [2018-07-25 08:37:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:11,752 INFO L472 AbstractCegarLoop]: Abstraction has 720 states and 1226 transitions. [2018-07-25 08:37:11,752 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1226 transitions. [2018-07-25 08:37:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:11,753 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:11,754 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:11,754 INFO L415 AbstractCegarLoop]: === Iteration 49 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash -176946971, now seen corresponding path program 1 times [2018-07-25 08:37:11,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:11,770 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:11,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:11,770 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:11,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:11,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:11,771 INFO L87 Difference]: Start difference. First operand 720 states and 1226 transitions. Second operand 10 states. [2018-07-25 08:37:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:12,332 INFO L93 Difference]: Finished difference Result 843 states and 1413 transitions. [2018-07-25 08:37:12,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:37:12,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:37:12,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:12,337 INFO L225 Difference]: With dead ends: 843 [2018-07-25 08:37:12,337 INFO L226 Difference]: Without dead ends: 841 [2018-07-25 08:37:12,338 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:37:12,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-07-25 08:37:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 770. [2018-07-25 08:37:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-07-25 08:37:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1300 transitions. [2018-07-25 08:37:12,676 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1300 transitions. Word has length 15 [2018-07-25 08:37:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:12,677 INFO L472 AbstractCegarLoop]: Abstraction has 770 states and 1300 transitions. [2018-07-25 08:37:12,677 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1300 transitions. [2018-07-25 08:37:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:12,678 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:12,678 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:12,678 INFO L415 AbstractCegarLoop]: === Iteration 50 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-07-25 08:37:12,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:12,691 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:12,691 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:12,691 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:12,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:12,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:12,692 INFO L87 Difference]: Start difference. First operand 770 states and 1300 transitions. Second operand 10 states. [2018-07-25 08:37:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:13,286 INFO L93 Difference]: Finished difference Result 960 states and 1623 transitions. [2018-07-25 08:37:13,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:37:13,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:37:13,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:13,290 INFO L225 Difference]: With dead ends: 960 [2018-07-25 08:37:13,290 INFO L226 Difference]: Without dead ends: 958 [2018-07-25 08:37:13,291 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:37:13,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2018-07-25 08:37:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 837. [2018-07-25 08:37:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-07-25 08:37:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1422 transitions. [2018-07-25 08:37:13,711 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1422 transitions. Word has length 15 [2018-07-25 08:37:13,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:13,711 INFO L472 AbstractCegarLoop]: Abstraction has 837 states and 1422 transitions. [2018-07-25 08:37:13,711 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1422 transitions. [2018-07-25 08:37:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:13,712 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:13,712 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:13,713 INFO L415 AbstractCegarLoop]: === Iteration 51 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1949120374, now seen corresponding path program 2 times [2018-07-25 08:37:13,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:13,724 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:13,724 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:13,724 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:13,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:13,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:13,725 INFO L87 Difference]: Start difference. First operand 837 states and 1422 transitions. Second operand 10 states. [2018-07-25 08:37:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:14,616 INFO L93 Difference]: Finished difference Result 1027 states and 1720 transitions. [2018-07-25 08:37:14,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:37:14,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:37:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:14,622 INFO L225 Difference]: With dead ends: 1027 [2018-07-25 08:37:14,622 INFO L226 Difference]: Without dead ends: 1025 [2018-07-25 08:37:14,623 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:37:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-07-25 08:37:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 849. [2018-07-25 08:37:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-07-25 08:37:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1445 transitions. [2018-07-25 08:37:15,168 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1445 transitions. Word has length 15 [2018-07-25 08:37:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:15,168 INFO L472 AbstractCegarLoop]: Abstraction has 849 states and 1445 transitions. [2018-07-25 08:37:15,168 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1445 transitions. [2018-07-25 08:37:15,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:15,169 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:15,170 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:37:15,170 INFO L415 AbstractCegarLoop]: === Iteration 52 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:15,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-07-25 08:37:15,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:15,183 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:15,183 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:15,183 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:15,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:15,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:15,184 INFO L87 Difference]: Start difference. First operand 849 states and 1445 transitions. Second operand 10 states. [2018-07-25 08:37:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:15,988 INFO L93 Difference]: Finished difference Result 1032 states and 1733 transitions. [2018-07-25 08:37:15,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:37:15,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:37:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:15,994 INFO L225 Difference]: With dead ends: 1032 [2018-07-25 08:37:15,994 INFO L226 Difference]: Without dead ends: 1030 [2018-07-25 08:37:15,994 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:37:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-07-25 08:37:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 869. [2018-07-25 08:37:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-07-25 08:37:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1477 transitions. [2018-07-25 08:37:16,377 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1477 transitions. Word has length 15 [2018-07-25 08:37:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:16,378 INFO L472 AbstractCegarLoop]: Abstraction has 869 states and 1477 transitions. [2018-07-25 08:37:16,378 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:16,378 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1477 transitions. [2018-07-25 08:37:16,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:16,379 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:16,379 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:16,380 INFO L415 AbstractCegarLoop]: === Iteration 53 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:16,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1652283980, now seen corresponding path program 1 times [2018-07-25 08:37:16,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:16,392 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:16,392 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:16,392 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:16,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:16,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:16,393 INFO L87 Difference]: Start difference. First operand 869 states and 1477 transitions. Second operand 10 states. [2018-07-25 08:37:16,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:16,903 INFO L93 Difference]: Finished difference Result 945 states and 1593 transitions. [2018-07-25 08:37:16,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:37:16,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:37:16,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:16,908 INFO L225 Difference]: With dead ends: 945 [2018-07-25 08:37:16,908 INFO L226 Difference]: Without dead ends: 943 [2018-07-25 08:37:16,909 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:37:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-07-25 08:37:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 869. [2018-07-25 08:37:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-07-25 08:37:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1474 transitions. [2018-07-25 08:37:17,284 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1474 transitions. Word has length 15 [2018-07-25 08:37:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:17,284 INFO L472 AbstractCegarLoop]: Abstraction has 869 states and 1474 transitions. [2018-07-25 08:37:17,285 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1474 transitions. [2018-07-25 08:37:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:17,286 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:17,286 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:17,286 INFO L415 AbstractCegarLoop]: === Iteration 54 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:17,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1643695811, now seen corresponding path program 1 times [2018-07-25 08:37:17,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:17,299 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:17,299 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:17,299 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:17,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:17,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:17,300 INFO L87 Difference]: Start difference. First operand 869 states and 1474 transitions. Second operand 10 states. [2018-07-25 08:37:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:17,848 INFO L93 Difference]: Finished difference Result 978 states and 1648 transitions. [2018-07-25 08:37:17,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:37:17,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:37:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:17,853 INFO L225 Difference]: With dead ends: 978 [2018-07-25 08:37:17,853 INFO L226 Difference]: Without dead ends: 976 [2018-07-25 08:37:17,854 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:37:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-07-25 08:37:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 871. [2018-07-25 08:37:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-07-25 08:37:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1477 transitions. [2018-07-25 08:37:18,209 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1477 transitions. Word has length 15 [2018-07-25 08:37:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:18,210 INFO L472 AbstractCegarLoop]: Abstraction has 871 states and 1477 transitions. [2018-07-25 08:37:18,210 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1477 transitions. [2018-07-25 08:37:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:18,211 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:18,211 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:18,211 INFO L415 AbstractCegarLoop]: === Iteration 55 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:18,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1603552790, now seen corresponding path program 1 times [2018-07-25 08:37:18,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:18,223 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:18,223 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:18,223 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:18,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:18,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:18,223 INFO L87 Difference]: Start difference. First operand 871 states and 1477 transitions. Second operand 10 states. [2018-07-25 08:37:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:18,861 INFO L93 Difference]: Finished difference Result 1018 states and 1716 transitions. [2018-07-25 08:37:18,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:37:18,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:37:18,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:18,866 INFO L225 Difference]: With dead ends: 1018 [2018-07-25 08:37:18,866 INFO L226 Difference]: Without dead ends: 1016 [2018-07-25 08:37:18,867 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:37:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-07-25 08:37:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 931. [2018-07-25 08:37:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-07-25 08:37:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1584 transitions. [2018-07-25 08:37:19,237 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1584 transitions. Word has length 15 [2018-07-25 08:37:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:19,237 INFO L472 AbstractCegarLoop]: Abstraction has 931 states and 1584 transitions. [2018-07-25 08:37:19,237 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1584 transitions. [2018-07-25 08:37:19,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:19,238 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:19,238 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:19,239 INFO L415 AbstractCegarLoop]: === Iteration 56 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:19,239 INFO L82 PathProgramCache]: Analyzing trace with hash -38294824, now seen corresponding path program 2 times [2018-07-25 08:37:19,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:19,251 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:19,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:19,251 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:19,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:19,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:19,252 INFO L87 Difference]: Start difference. First operand 931 states and 1584 transitions. Second operand 10 states. [2018-07-25 08:37:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:19,841 INFO L93 Difference]: Finished difference Result 1157 states and 1937 transitions. [2018-07-25 08:37:19,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:37:19,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:37:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:19,846 INFO L225 Difference]: With dead ends: 1157 [2018-07-25 08:37:19,846 INFO L226 Difference]: Without dead ends: 1155 [2018-07-25 08:37:19,846 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:37:19,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-07-25 08:37:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 976. [2018-07-25 08:37:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-07-25 08:37:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1662 transitions. [2018-07-25 08:37:20,245 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1662 transitions. Word has length 15 [2018-07-25 08:37:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:20,245 INFO L472 AbstractCegarLoop]: Abstraction has 976 states and 1662 transitions. [2018-07-25 08:37:20,245 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1662 transitions. [2018-07-25 08:37:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:20,246 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:20,246 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:20,247 INFO L415 AbstractCegarLoop]: === Iteration 57 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -29706655, now seen corresponding path program 2 times [2018-07-25 08:37:20,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:20,259 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:20,259 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:20,259 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:20,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:20,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:20,260 INFO L87 Difference]: Start difference. First operand 976 states and 1662 transitions. Second operand 10 states. [2018-07-25 08:37:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:20,933 INFO L93 Difference]: Finished difference Result 1198 states and 2004 transitions. [2018-07-25 08:37:20,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:37:20,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:37:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:20,937 INFO L225 Difference]: With dead ends: 1198 [2018-07-25 08:37:20,937 INFO L226 Difference]: Without dead ends: 1196 [2018-07-25 08:37:20,938 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:37:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-07-25 08:37:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 998. [2018-07-25 08:37:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-07-25 08:37:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1695 transitions. [2018-07-25 08:37:21,329 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1695 transitions. Word has length 15 [2018-07-25 08:37:21,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:21,329 INFO L472 AbstractCegarLoop]: Abstraction has 998 states and 1695 transitions. [2018-07-25 08:37:21,329 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1695 transitions. [2018-07-25 08:37:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:37:21,330 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:21,330 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:21,331 INFO L415 AbstractCegarLoop]: === Iteration 58 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:21,331 INFO L82 PathProgramCache]: Analyzing trace with hash 10436366, now seen corresponding path program 2 times [2018-07-25 08:37:21,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:21,341 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:21,341 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:21,341 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:21,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:21,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:21,342 INFO L87 Difference]: Start difference. First operand 998 states and 1695 transitions. Second operand 10 states. [2018-07-25 08:37:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:21,933 INFO L93 Difference]: Finished difference Result 1161 states and 1935 transitions. [2018-07-25 08:37:21,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:37:21,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:37:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:21,935 INFO L225 Difference]: With dead ends: 1161 [2018-07-25 08:37:21,935 INFO L226 Difference]: Without dead ends: 1159 [2018-07-25 08:37:21,936 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:37:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-07-25 08:37:22,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1022. [2018-07-25 08:37:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2018-07-25 08:37:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1728 transitions. [2018-07-25 08:37:22,350 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1728 transitions. Word has length 15 [2018-07-25 08:37:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:22,350 INFO L472 AbstractCegarLoop]: Abstraction has 1022 states and 1728 transitions. [2018-07-25 08:37:22,350 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1728 transitions. [2018-07-25 08:37:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:22,351 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:22,352 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:22,352 INFO L415 AbstractCegarLoop]: === Iteration 59 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:22,352 INFO L82 PathProgramCache]: Analyzing trace with hash 415120859, now seen corresponding path program 1 times [2018-07-25 08:37:22,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:22,366 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:22,366 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:22,367 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:22,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:22,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:22,367 INFO L87 Difference]: Start difference. First operand 1022 states and 1728 transitions. Second operand 10 states. [2018-07-25 08:37:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:22,983 INFO L93 Difference]: Finished difference Result 1173 states and 1946 transitions. [2018-07-25 08:37:22,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:37:22,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-07-25 08:37:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:22,985 INFO L225 Difference]: With dead ends: 1173 [2018-07-25 08:37:22,985 INFO L226 Difference]: Without dead ends: 1171 [2018-07-25 08:37:22,986 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:37:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2018-07-25 08:37:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1065. [2018-07-25 08:37:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2018-07-25 08:37:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1806 transitions. [2018-07-25 08:37:23,446 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1806 transitions. Word has length 16 [2018-07-25 08:37:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:23,446 INFO L472 AbstractCegarLoop]: Abstraction has 1065 states and 1806 transitions. [2018-07-25 08:37:23,446 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1806 transitions. [2018-07-25 08:37:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:23,447 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:23,447 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:23,448 INFO L415 AbstractCegarLoop]: === Iteration 60 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:23,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1829543949, now seen corresponding path program 1 times [2018-07-25 08:37:23,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:23,454 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:23,454 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:23,455 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:37:23,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:37:23,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:37:23,455 INFO L87 Difference]: Start difference. First operand 1065 states and 1806 transitions. Second operand 7 states. [2018-07-25 08:37:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:24,221 INFO L93 Difference]: Finished difference Result 2706 states and 4565 transitions. [2018-07-25 08:37:24,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:37:24,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-25 08:37:24,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:24,224 INFO L225 Difference]: With dead ends: 2706 [2018-07-25 08:37:24,224 INFO L226 Difference]: Without dead ends: 1625 [2018-07-25 08:37:24,226 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:37:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2018-07-25 08:37:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1258. [2018-07-25 08:37:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1258 states. [2018-07-25 08:37:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 2139 transitions. [2018-07-25 08:37:24,753 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 2139 transitions. Word has length 16 [2018-07-25 08:37:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:24,753 INFO L472 AbstractCegarLoop]: Abstraction has 1258 states and 2139 transitions. [2018-07-25 08:37:24,753 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:37:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 2139 transitions. [2018-07-25 08:37:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:24,755 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:24,755 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:24,755 INFO L415 AbstractCegarLoop]: === Iteration 61 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:24,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1269790439, now seen corresponding path program 1 times [2018-07-25 08:37:24,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:24,763 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:24,763 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:24,763 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:37:24,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:37:24,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:37:24,764 INFO L87 Difference]: Start difference. First operand 1258 states and 2139 transitions. Second operand 7 states. [2018-07-25 08:37:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:25,665 INFO L93 Difference]: Finished difference Result 3012 states and 5088 transitions. [2018-07-25 08:37:25,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:37:25,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-25 08:37:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:25,669 INFO L225 Difference]: With dead ends: 3012 [2018-07-25 08:37:25,669 INFO L226 Difference]: Without dead ends: 1713 [2018-07-25 08:37:25,672 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:37:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2018-07-25 08:37:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1521. [2018-07-25 08:37:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-07-25 08:37:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2545 transitions. [2018-07-25 08:37:26,342 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2545 transitions. Word has length 16 [2018-07-25 08:37:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:26,343 INFO L472 AbstractCegarLoop]: Abstraction has 1521 states and 2545 transitions. [2018-07-25 08:37:26,343 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:37:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2545 transitions. [2018-07-25 08:37:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:26,344 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:26,344 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:26,344 INFO L415 AbstractCegarLoop]: === Iteration 62 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash 323600233, now seen corresponding path program 2 times [2018-07-25 08:37:26,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:26,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:26,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:26,352 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:37:26,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:37:26,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:37:26,352 INFO L87 Difference]: Start difference. First operand 1521 states and 2545 transitions. Second operand 7 states. [2018-07-25 08:37:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:27,342 INFO L93 Difference]: Finished difference Result 3615 states and 5961 transitions. [2018-07-25 08:37:27,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:37:27,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-25 08:37:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:27,347 INFO L225 Difference]: With dead ends: 3615 [2018-07-25 08:37:27,347 INFO L226 Difference]: Without dead ends: 2069 [2018-07-25 08:37:27,350 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:37:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2018-07-25 08:37:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1724. [2018-07-25 08:37:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2018-07-25 08:37:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2809 transitions. [2018-07-25 08:37:28,197 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2809 transitions. Word has length 16 [2018-07-25 08:37:28,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:28,198 INFO L472 AbstractCegarLoop]: Abstraction has 1724 states and 2809 transitions. [2018-07-25 08:37:28,198 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:37:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2809 transitions. [2018-07-25 08:37:28,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:37:28,199 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:28,200 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:28,200 INFO L415 AbstractCegarLoop]: === Iteration 63 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:28,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1273855967, now seen corresponding path program 2 times [2018-07-25 08:37:28,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:28,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:28,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:28,219 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:28,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:28,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:28,220 INFO L87 Difference]: Start difference. First operand 1724 states and 2809 transitions. Second operand 11 states. [2018-07-25 08:37:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:29,343 INFO L93 Difference]: Finished difference Result 1829 states and 2955 transitions. [2018-07-25 08:37:29,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:37:29,343 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-07-25 08:37:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:29,346 INFO L225 Difference]: With dead ends: 1829 [2018-07-25 08:37:29,347 INFO L226 Difference]: Without dead ends: 1820 [2018-07-25 08:37:29,348 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:37:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2018-07-25 08:37:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1714. [2018-07-25 08:37:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2018-07-25 08:37:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2793 transitions. [2018-07-25 08:37:30,126 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2793 transitions. Word has length 17 [2018-07-25 08:37:30,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:30,126 INFO L472 AbstractCegarLoop]: Abstraction has 1714 states and 2793 transitions. [2018-07-25 08:37:30,126 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2793 transitions. [2018-07-25 08:37:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:30,128 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:30,128 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:37:30,128 INFO L415 AbstractCegarLoop]: === Iteration 64 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:30,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1080543844, now seen corresponding path program 1 times [2018-07-25 08:37:30,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:30,166 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:30,166 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:37:30,166 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:37:30,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:37:30,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:30,167 INFO L87 Difference]: Start difference. First operand 1714 states and 2793 transitions. Second operand 12 states. [2018-07-25 08:37:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:31,101 INFO L93 Difference]: Finished difference Result 1784 states and 2895 transitions. [2018-07-25 08:37:31,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:37:31,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 08:37:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:31,105 INFO L225 Difference]: With dead ends: 1784 [2018-07-25 08:37:31,106 INFO L226 Difference]: Without dead ends: 1783 [2018-07-25 08:37:31,107 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:37:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2018-07-25 08:37:32,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1719. [2018-07-25 08:37:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2018-07-25 08:37:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2802 transitions. [2018-07-25 08:37:32,058 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2802 transitions. Word has length 18 [2018-07-25 08:37:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:32,059 INFO L472 AbstractCegarLoop]: Abstraction has 1719 states and 2802 transitions. [2018-07-25 08:37:32,059 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:37:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2802 transitions. [2018-07-25 08:37:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:32,060 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:32,060 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:32,060 INFO L415 AbstractCegarLoop]: === Iteration 65 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:32,061 INFO L82 PathProgramCache]: Analyzing trace with hash 818532565, now seen corresponding path program 1 times [2018-07-25 08:37:32,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:32,081 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:32,081 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:37:32,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:37:32,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:37:32,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:32,081 INFO L87 Difference]: Start difference. First operand 1719 states and 2802 transitions. Second operand 12 states. [2018-07-25 08:37:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:33,014 INFO L93 Difference]: Finished difference Result 1783 states and 2889 transitions. [2018-07-25 08:37:33,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:37:33,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 08:37:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:33,016 INFO L225 Difference]: With dead ends: 1783 [2018-07-25 08:37:33,016 INFO L226 Difference]: Without dead ends: 1781 [2018-07-25 08:37:33,017 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:37:33,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-07-25 08:37:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1723. [2018-07-25 08:37:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-07-25 08:37:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2809 transitions. [2018-07-25 08:37:33,960 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2809 transitions. Word has length 18 [2018-07-25 08:37:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:33,960 INFO L472 AbstractCegarLoop]: Abstraction has 1723 states and 2809 transitions. [2018-07-25 08:37:33,961 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:37:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2809 transitions. [2018-07-25 08:37:33,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:33,962 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:33,962 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:37:33,962 INFO L415 AbstractCegarLoop]: === Iteration 66 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:33,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1629794958, now seen corresponding path program 2 times [2018-07-25 08:37:33,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:33,986 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:33,986 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:37:33,986 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:37:33,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:37:33,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:33,987 INFO L87 Difference]: Start difference. First operand 1723 states and 2809 transitions. Second operand 12 states. [2018-07-25 08:37:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:35,122 INFO L93 Difference]: Finished difference Result 2036 states and 3314 transitions. [2018-07-25 08:37:35,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:37:35,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 08:37:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:35,123 INFO L225 Difference]: With dead ends: 2036 [2018-07-25 08:37:35,124 INFO L226 Difference]: Without dead ends: 2035 [2018-07-25 08:37:35,124 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:37:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2018-07-25 08:37:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1858. [2018-07-25 08:37:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2018-07-25 08:37:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 3040 transitions. [2018-07-25 08:37:35,961 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 3040 transitions. Word has length 18 [2018-07-25 08:37:35,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:35,961 INFO L472 AbstractCegarLoop]: Abstraction has 1858 states and 3040 transitions. [2018-07-25 08:37:35,961 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:37:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 3040 transitions. [2018-07-25 08:37:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:35,962 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:35,962 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:35,962 INFO L415 AbstractCegarLoop]: === Iteration 67 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:35,962 INFO L82 PathProgramCache]: Analyzing trace with hash -446449989, now seen corresponding path program 1 times [2018-07-25 08:37:35,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:35,978 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:35,978 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:35,978 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:35,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:35,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:35,979 INFO L87 Difference]: Start difference. First operand 1858 states and 3040 transitions. Second operand 11 states. [2018-07-25 08:37:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:36,927 INFO L93 Difference]: Finished difference Result 2046 states and 3338 transitions. [2018-07-25 08:37:36,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:37:36,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:36,929 INFO L225 Difference]: With dead ends: 2046 [2018-07-25 08:37:36,930 INFO L226 Difference]: Without dead ends: 2044 [2018-07-25 08:37:36,930 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:37:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2018-07-25 08:37:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1922. [2018-07-25 08:37:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-07-25 08:37:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 3155 transitions. [2018-07-25 08:37:37,691 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 3155 transitions. Word has length 18 [2018-07-25 08:37:37,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:37,691 INFO L472 AbstractCegarLoop]: Abstraction has 1922 states and 3155 transitions. [2018-07-25 08:37:37,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 3155 transitions. [2018-07-25 08:37:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:37,693 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:37,693 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:37,694 INFO L415 AbstractCegarLoop]: === Iteration 68 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:37,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-07-25 08:37:37,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:37,712 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:37,712 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:37,712 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:37,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:37,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:37,713 INFO L87 Difference]: Start difference. First operand 1922 states and 3155 transitions. Second operand 11 states. [2018-07-25 08:37:38,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:38,852 INFO L93 Difference]: Finished difference Result 2251 states and 3688 transitions. [2018-07-25 08:37:38,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:37:38,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:38,854 INFO L225 Difference]: With dead ends: 2251 [2018-07-25 08:37:38,854 INFO L226 Difference]: Without dead ends: 2249 [2018-07-25 08:37:38,855 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:37:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2018-07-25 08:37:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2029. [2018-07-25 08:37:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-07-25 08:37:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3346 transitions. [2018-07-25 08:37:39,651 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3346 transitions. Word has length 18 [2018-07-25 08:37:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:39,651 INFO L472 AbstractCegarLoop]: Abstraction has 2029 states and 3346 transitions. [2018-07-25 08:37:39,651 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3346 transitions. [2018-07-25 08:37:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:39,653 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:39,653 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:39,653 INFO L415 AbstractCegarLoop]: === Iteration 69 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:39,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310343, now seen corresponding path program 3 times [2018-07-25 08:37:39,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:39,670 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:39,670 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:37:39,671 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:37:39,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:37:39,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:39,671 INFO L87 Difference]: Start difference. First operand 2029 states and 3346 transitions. Second operand 13 states. [2018-07-25 08:37:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:40,652 INFO L93 Difference]: Finished difference Result 2101 states and 3451 transitions. [2018-07-25 08:37:40,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:37:40,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-25 08:37:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:40,654 INFO L225 Difference]: With dead ends: 2101 [2018-07-25 08:37:40,654 INFO L226 Difference]: Without dead ends: 2100 [2018-07-25 08:37:40,655 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:37:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2018-07-25 08:37:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2029. [2018-07-25 08:37:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-07-25 08:37:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3343 transitions. [2018-07-25 08:37:41,547 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3343 transitions. Word has length 18 [2018-07-25 08:37:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:41,547 INFO L472 AbstractCegarLoop]: Abstraction has 2029 states and 3343 transitions. [2018-07-25 08:37:41,547 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3343 transitions. [2018-07-25 08:37:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:41,548 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:41,549 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:41,549 INFO L415 AbstractCegarLoop]: === Iteration 70 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:41,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1235464429, now seen corresponding path program 2 times [2018-07-25 08:37:41,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:41,563 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:41,563 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:41,563 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:41,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:41,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:41,563 INFO L87 Difference]: Start difference. First operand 2029 states and 3343 transitions. Second operand 11 states. [2018-07-25 08:37:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:42,762 INFO L93 Difference]: Finished difference Result 2256 states and 3702 transitions. [2018-07-25 08:37:42,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:37:42,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:42,765 INFO L225 Difference]: With dead ends: 2256 [2018-07-25 08:37:42,765 INFO L226 Difference]: Without dead ends: 2254 [2018-07-25 08:37:42,766 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:37:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2018-07-25 08:37:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2040. [2018-07-25 08:37:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2018-07-25 08:37:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 3369 transitions. [2018-07-25 08:37:43,656 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 3369 transitions. Word has length 18 [2018-07-25 08:37:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:43,656 INFO L472 AbstractCegarLoop]: Abstraction has 2040 states and 3369 transitions. [2018-07-25 08:37:43,656 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 3369 transitions. [2018-07-25 08:37:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:43,657 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:43,657 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:37:43,657 INFO L415 AbstractCegarLoop]: === Iteration 71 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash -111984382, now seen corresponding path program 4 times [2018-07-25 08:37:43,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:43,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:43,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:37:43,669 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:37:43,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:37:43,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:43,670 INFO L87 Difference]: Start difference. First operand 2040 states and 3369 transitions. Second operand 12 states. [2018-07-25 08:37:44,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:44,943 INFO L93 Difference]: Finished difference Result 2243 states and 3672 transitions. [2018-07-25 08:37:44,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:37:44,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 08:37:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:44,945 INFO L225 Difference]: With dead ends: 2243 [2018-07-25 08:37:44,946 INFO L226 Difference]: Without dead ends: 2242 [2018-07-25 08:37:44,946 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:37:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2018-07-25 08:37:45,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2029. [2018-07-25 08:37:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-07-25 08:37:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3348 transitions. [2018-07-25 08:37:45,830 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3348 transitions. Word has length 18 [2018-07-25 08:37:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:45,830 INFO L472 AbstractCegarLoop]: Abstraction has 2029 states and 3348 transitions. [2018-07-25 08:37:45,830 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:37:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3348 transitions. [2018-07-25 08:37:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:45,832 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:45,832 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:45,832 INFO L415 AbstractCegarLoop]: === Iteration 72 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:45,832 INFO L82 PathProgramCache]: Analyzing trace with hash -111983100, now seen corresponding path program 1 times [2018-07-25 08:37:45,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:45,843 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:45,843 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:45,843 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:45,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:45,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:45,844 INFO L87 Difference]: Start difference. First operand 2029 states and 3348 transitions. Second operand 11 states. [2018-07-25 08:37:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:46,990 INFO L93 Difference]: Finished difference Result 2267 states and 3717 transitions. [2018-07-25 08:37:46,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:37:46,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:46,993 INFO L225 Difference]: With dead ends: 2267 [2018-07-25 08:37:46,993 INFO L226 Difference]: Without dead ends: 2265 [2018-07-25 08:37:46,994 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:37:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2018-07-25 08:37:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2063. [2018-07-25 08:37:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2018-07-25 08:37:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 3413 transitions. [2018-07-25 08:37:47,826 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 3413 transitions. Word has length 18 [2018-07-25 08:37:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:47,827 INFO L472 AbstractCegarLoop]: Abstraction has 2063 states and 3413 transitions. [2018-07-25 08:37:47,827 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 3413 transitions. [2018-07-25 08:37:47,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:47,829 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:47,829 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:47,829 INFO L415 AbstractCegarLoop]: === Iteration 73 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:47,829 INFO L82 PathProgramCache]: Analyzing trace with hash -103396213, now seen corresponding path program 2 times [2018-07-25 08:37:47,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:47,843 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:47,844 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:47,844 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:47,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:47,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:47,844 INFO L87 Difference]: Start difference. First operand 2063 states and 3413 transitions. Second operand 11 states. [2018-07-25 08:37:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:49,074 INFO L93 Difference]: Finished difference Result 2234 states and 3657 transitions. [2018-07-25 08:37:49,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:37:49,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:49,076 INFO L225 Difference]: With dead ends: 2234 [2018-07-25 08:37:49,076 INFO L226 Difference]: Without dead ends: 2232 [2018-07-25 08:37:49,077 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:37:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2018-07-25 08:37:49,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2062. [2018-07-25 08:37:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2018-07-25 08:37:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 3410 transitions. [2018-07-25 08:37:49,908 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 3410 transitions. Word has length 18 [2018-07-25 08:37:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:49,908 INFO L472 AbstractCegarLoop]: Abstraction has 2062 states and 3410 transitions. [2018-07-25 08:37:49,909 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 3410 transitions. [2018-07-25 08:37:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:49,910 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:49,911 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:49,911 INFO L415 AbstractCegarLoop]: === Iteration 74 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:49,911 INFO L82 PathProgramCache]: Analyzing trace with hash -103395925, now seen corresponding path program 5 times [2018-07-25 08:37:49,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:49,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:49,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:37:49,927 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:37:49,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:37:49,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:49,928 INFO L87 Difference]: Start difference. First operand 2062 states and 3410 transitions. Second operand 13 states. [2018-07-25 08:37:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:51,022 INFO L93 Difference]: Finished difference Result 2220 states and 3648 transitions. [2018-07-25 08:37:51,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:37:51,023 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-25 08:37:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:51,025 INFO L225 Difference]: With dead ends: 2220 [2018-07-25 08:37:51,025 INFO L226 Difference]: Without dead ends: 2219 [2018-07-25 08:37:51,025 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:37:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2018-07-25 08:37:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2062. [2018-07-25 08:37:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2018-07-25 08:37:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 3406 transitions. [2018-07-25 08:37:51,931 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 3406 transitions. Word has length 18 [2018-07-25 08:37:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:51,931 INFO L472 AbstractCegarLoop]: Abstraction has 2062 states and 3406 transitions. [2018-07-25 08:37:51,931 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 3406 transitions. [2018-07-25 08:37:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:51,933 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:51,933 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:51,933 INFO L415 AbstractCegarLoop]: === Iteration 75 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-07-25 08:37:51,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:51,946 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:51,946 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:51,947 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:51,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:51,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:51,947 INFO L87 Difference]: Start difference. First operand 2062 states and 3406 transitions. Second operand 11 states. [2018-07-25 08:37:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:53,131 INFO L93 Difference]: Finished difference Result 2348 states and 3848 transitions. [2018-07-25 08:37:53,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:37:53,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:53,134 INFO L225 Difference]: With dead ends: 2348 [2018-07-25 08:37:53,134 INFO L226 Difference]: Without dead ends: 2346 [2018-07-25 08:37:53,135 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:37:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2018-07-25 08:37:53,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2069. [2018-07-25 08:37:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2069 states. [2018-07-25 08:37:53,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3421 transitions. [2018-07-25 08:37:53,972 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3421 transitions. Word has length 18 [2018-07-25 08:37:53,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:53,972 INFO L472 AbstractCegarLoop]: Abstraction has 2069 states and 3421 transitions. [2018-07-25 08:37:53,972 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3421 transitions. [2018-07-25 08:37:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:53,973 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:53,973 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:53,973 INFO L415 AbstractCegarLoop]: === Iteration 76 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:53,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 3 times [2018-07-25 08:37:53,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:53,985 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:53,986 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:53,986 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:53,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:53,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:53,986 INFO L87 Difference]: Start difference. First operand 2069 states and 3421 transitions. Second operand 11 states. [2018-07-25 08:37:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:55,211 INFO L93 Difference]: Finished difference Result 2308 states and 3773 transitions. [2018-07-25 08:37:55,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:37:55,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:55,213 INFO L225 Difference]: With dead ends: 2308 [2018-07-25 08:37:55,213 INFO L226 Difference]: Without dead ends: 2306 [2018-07-25 08:37:55,214 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:37:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2018-07-25 08:37:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2060. [2018-07-25 08:37:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2060 states. [2018-07-25 08:37:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 3397 transitions. [2018-07-25 08:37:56,047 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 3397 transitions. Word has length 18 [2018-07-25 08:37:56,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:56,048 INFO L472 AbstractCegarLoop]: Abstraction has 2060 states and 3397 transitions. [2018-07-25 08:37:56,048 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 3397 transitions. [2018-07-25 08:37:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:56,049 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:56,049 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:56,049 INFO L415 AbstractCegarLoop]: === Iteration 77 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:56,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170099, now seen corresponding path program 6 times [2018-07-25 08:37:56,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:56,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:56,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:37:56,060 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:37:56,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:37:56,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:56,061 INFO L87 Difference]: Start difference. First operand 2060 states and 3397 transitions. Second operand 13 states. [2018-07-25 08:37:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:57,293 INFO L93 Difference]: Finished difference Result 2308 states and 3783 transitions. [2018-07-25 08:37:57,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:37:57,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-25 08:37:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:57,296 INFO L225 Difference]: With dead ends: 2308 [2018-07-25 08:37:57,296 INFO L226 Difference]: Without dead ends: 2307 [2018-07-25 08:37:57,296 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:37:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2018-07-25 08:37:58,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2057. [2018-07-25 08:37:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2018-07-25 08:37:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3387 transitions. [2018-07-25 08:37:58,157 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3387 transitions. Word has length 18 [2018-07-25 08:37:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:58,158 INFO L472 AbstractCegarLoop]: Abstraction has 2057 states and 3387 transitions. [2018-07-25 08:37:58,158 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3387 transitions. [2018-07-25 08:37:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:58,159 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:58,159 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:58,159 INFO L415 AbstractCegarLoop]: === Iteration 78 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:58,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1198893179, now seen corresponding path program 4 times [2018-07-25 08:37:58,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:58,172 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:58,172 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:58,172 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:58,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:58,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:58,173 INFO L87 Difference]: Start difference. First operand 2057 states and 3387 transitions. Second operand 11 states. [2018-07-25 08:37:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:59,524 INFO L93 Difference]: Finished difference Result 2380 states and 3900 transitions. [2018-07-25 08:37:59,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:37:59,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:59,527 INFO L225 Difference]: With dead ends: 2380 [2018-07-25 08:37:59,527 INFO L226 Difference]: Without dead ends: 2378 [2018-07-25 08:37:59,528 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:37:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2018-07-25 08:38:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2049. [2018-07-25 08:38:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2018-07-25 08:38:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 3368 transitions. [2018-07-25 08:38:00,386 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 3368 transitions. Word has length 18 [2018-07-25 08:38:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:00,386 INFO L472 AbstractCegarLoop]: Abstraction has 2049 states and 3368 transitions. [2018-07-25 08:38:00,386 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:38:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 3368 transitions. [2018-07-25 08:38:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:38:00,387 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:00,387 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:00,388 INFO L415 AbstractCegarLoop]: === Iteration 79 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:00,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1428793719, now seen corresponding path program 1 times [2018-07-25 08:38:00,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:00,400 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:00,400 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:38:00,400 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:38:00,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:38:00,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:38:00,401 INFO L87 Difference]: Start difference. First operand 2049 states and 3368 transitions. Second operand 11 states. [2018-07-25 08:38:01,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:01,444 INFO L93 Difference]: Finished difference Result 2143 states and 3512 transitions. [2018-07-25 08:38:01,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:38:01,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:38:01,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:01,447 INFO L225 Difference]: With dead ends: 2143 [2018-07-25 08:38:01,447 INFO L226 Difference]: Without dead ends: 2141 [2018-07-25 08:38:01,447 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:38:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2018-07-25 08:38:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2055. [2018-07-25 08:38:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2018-07-25 08:38:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3378 transitions. [2018-07-25 08:38:02,308 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3378 transitions. Word has length 18 [2018-07-25 08:38:02,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:02,308 INFO L472 AbstractCegarLoop]: Abstraction has 2055 states and 3378 transitions. [2018-07-25 08:38:02,308 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:38:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3378 transitions. [2018-07-25 08:38:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:38:02,309 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:02,309 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:02,310 INFO L415 AbstractCegarLoop]: === Iteration 80 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:02,310 INFO L82 PathProgramCache]: Analyzing trace with hash 383805696, now seen corresponding path program 1 times [2018-07-25 08:38:02,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:02,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:02,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:38:02,326 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:38:02,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:38:02,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:38:02,326 INFO L87 Difference]: Start difference. First operand 2055 states and 3378 transitions. Second operand 11 states. [2018-07-25 08:38:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:03,479 INFO L93 Difference]: Finished difference Result 2243 states and 3674 transitions. [2018-07-25 08:38:03,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:38:03,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:38:03,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:03,482 INFO L225 Difference]: With dead ends: 2243 [2018-07-25 08:38:03,482 INFO L226 Difference]: Without dead ends: 2241 [2018-07-25 08:38:03,482 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:38:03,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2018-07-25 08:38:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2072. [2018-07-25 08:38:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-07-25 08:38:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3406 transitions. [2018-07-25 08:38:04,379 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3406 transitions. Word has length 18 [2018-07-25 08:38:04,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:04,379 INFO L472 AbstractCegarLoop]: Abstraction has 2072 states and 3406 transitions. [2018-07-25 08:38:04,379 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:38:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3406 transitions. [2018-07-25 08:38:04,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:04,381 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:04,381 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:04,381 INFO L415 AbstractCegarLoop]: === Iteration 81 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:04,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-07-25 08:38:04,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:04,404 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:04,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:38:04,404 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:38:04,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:38:04,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:38:04,405 INFO L87 Difference]: Start difference. First operand 2072 states and 3406 transitions. Second operand 13 states. [2018-07-25 08:38:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:05,563 INFO L93 Difference]: Finished difference Result 2153 states and 3525 transitions. [2018-07-25 08:38:05,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:38:05,564 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 08:38:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:05,566 INFO L225 Difference]: With dead ends: 2153 [2018-07-25 08:38:05,566 INFO L226 Difference]: Without dead ends: 2152 [2018-07-25 08:38:05,567 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:38:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2018-07-25 08:38:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2082. [2018-07-25 08:38:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2018-07-25 08:38:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3423 transitions. [2018-07-25 08:38:06,490 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3423 transitions. Word has length 19 [2018-07-25 08:38:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:06,491 INFO L472 AbstractCegarLoop]: Abstraction has 2082 states and 3423 transitions. [2018-07-25 08:38:06,491 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:38:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3423 transitions. [2018-07-25 08:38:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:06,493 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:06,493 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:06,493 INFO L415 AbstractCegarLoop]: === Iteration 82 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:06,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1639758835, now seen corresponding path program 1 times [2018-07-25 08:38:06,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:06,519 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:06,519 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:38:06,519 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:38:06,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:38:06,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:38:06,520 INFO L87 Difference]: Start difference. First operand 2082 states and 3423 transitions. Second operand 13 states. [2018-07-25 08:38:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:07,775 INFO L93 Difference]: Finished difference Result 2189 states and 3589 transitions. [2018-07-25 08:38:07,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:38:07,775 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 08:38:07,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:07,777 INFO L225 Difference]: With dead ends: 2189 [2018-07-25 08:38:07,778 INFO L226 Difference]: Without dead ends: 2187 [2018-07-25 08:38:07,778 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:38:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-07-25 08:38:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2100. [2018-07-25 08:38:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2018-07-25 08:38:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3458 transitions. [2018-07-25 08:38:08,676 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3458 transitions. Word has length 19 [2018-07-25 08:38:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:08,676 INFO L472 AbstractCegarLoop]: Abstraction has 2100 states and 3458 transitions. [2018-07-25 08:38:08,676 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:38:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3458 transitions. [2018-07-25 08:38:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:08,677 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:08,677 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:08,677 INFO L415 AbstractCegarLoop]: === Iteration 83 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2095454951, now seen corresponding path program 2 times [2018-07-25 08:38:08,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:08,699 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:08,699 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:08,699 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:08,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:08,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:08,699 INFO L87 Difference]: Start difference. First operand 2100 states and 3458 transitions. Second operand 12 states. [2018-07-25 08:38:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:09,904 INFO L93 Difference]: Finished difference Result 2277 states and 3736 transitions. [2018-07-25 08:38:09,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:38:09,904 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 08:38:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:09,906 INFO L225 Difference]: With dead ends: 2277 [2018-07-25 08:38:09,906 INFO L226 Difference]: Without dead ends: 2275 [2018-07-25 08:38:09,907 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:38:09,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2018-07-25 08:38:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2170. [2018-07-25 08:38:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2018-07-25 08:38:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3573 transitions. [2018-07-25 08:38:10,897 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3573 transitions. Word has length 19 [2018-07-25 08:38:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:10,897 INFO L472 AbstractCegarLoop]: Abstraction has 2170 states and 3573 transitions. [2018-07-25 08:38:10,897 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3573 transitions. [2018-07-25 08:38:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:10,898 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:10,898 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:10,899 INFO L415 AbstractCegarLoop]: === Iteration 84 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1599772939, now seen corresponding path program 3 times [2018-07-25 08:38:10,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:10,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:10,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:10,916 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:10,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:10,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:10,917 INFO L87 Difference]: Start difference. First operand 2170 states and 3573 transitions. Second operand 12 states. [2018-07-25 08:38:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:12,385 INFO L93 Difference]: Finished difference Result 2400 states and 3933 transitions. [2018-07-25 08:38:12,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:38:12,385 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 08:38:12,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:12,387 INFO L225 Difference]: With dead ends: 2400 [2018-07-25 08:38:12,387 INFO L226 Difference]: Without dead ends: 2398 [2018-07-25 08:38:12,388 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:38:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2018-07-25 08:38:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2146. [2018-07-25 08:38:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2018-07-25 08:38:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3536 transitions. [2018-07-25 08:38:13,336 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3536 transitions. Word has length 19 [2018-07-25 08:38:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:13,336 INFO L472 AbstractCegarLoop]: Abstraction has 2146 states and 3536 transitions. [2018-07-25 08:38:13,336 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3536 transitions. [2018-07-25 08:38:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:13,338 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:13,338 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:13,338 INFO L415 AbstractCegarLoop]: === Iteration 85 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:13,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1654744567, now seen corresponding path program 1 times [2018-07-25 08:38:13,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-25 08:38:13,347 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:13,347 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:38:13,348 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:38:13,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:38:13,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:38:13,348 INFO L87 Difference]: Start difference. First operand 2146 states and 3536 transitions. Second operand 8 states. [2018-07-25 08:38:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:14,655 INFO L93 Difference]: Finished difference Result 4383 states and 7138 transitions. [2018-07-25 08:38:14,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:38:14,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-07-25 08:38:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:14,657 INFO L225 Difference]: With dead ends: 4383 [2018-07-25 08:38:14,657 INFO L226 Difference]: Without dead ends: 2069 [2018-07-25 08:38:14,660 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:38:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2018-07-25 08:38:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1775. [2018-07-25 08:38:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2018-07-25 08:38:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2940 transitions. [2018-07-25 08:38:15,559 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2940 transitions. Word has length 19 [2018-07-25 08:38:15,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:15,560 INFO L472 AbstractCegarLoop]: Abstraction has 1775 states and 2940 transitions. [2018-07-25 08:38:15,560 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:38:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2940 transitions. [2018-07-25 08:38:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:15,561 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:15,561 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:15,562 INFO L415 AbstractCegarLoop]: === Iteration 86 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:15,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times [2018-07-25 08:38:15,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:15,577 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:15,577 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:38:15,577 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:38:15,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:38:15,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:38:15,578 INFO L87 Difference]: Start difference. First operand 1775 states and 2940 transitions. Second operand 13 states. [2018-07-25 08:38:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:17,017 INFO L93 Difference]: Finished difference Result 2136 states and 3539 transitions. [2018-07-25 08:38:17,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:38:17,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 08:38:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:17,020 INFO L225 Difference]: With dead ends: 2136 [2018-07-25 08:38:17,020 INFO L226 Difference]: Without dead ends: 2134 [2018-07-25 08:38:17,020 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:38:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2018-07-25 08:38:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1982. [2018-07-25 08:38:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-07-25 08:38:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 3302 transitions. [2018-07-25 08:38:17,972 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 3302 transitions. Word has length 19 [2018-07-25 08:38:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:17,972 INFO L472 AbstractCegarLoop]: Abstraction has 1982 states and 3302 transitions. [2018-07-25 08:38:17,972 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:38:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 3302 transitions. [2018-07-25 08:38:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:17,974 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:17,974 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:17,974 INFO L415 AbstractCegarLoop]: === Iteration 87 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:17,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times [2018-07-25 08:38:17,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:17,989 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:17,989 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:38:17,989 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:38:17,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:38:17,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:38:17,990 INFO L87 Difference]: Start difference. First operand 1982 states and 3302 transitions. Second operand 13 states. [2018-07-25 08:38:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:20,251 INFO L93 Difference]: Finished difference Result 2923 states and 4923 transitions. [2018-07-25 08:38:20,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:38:20,252 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 08:38:20,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:20,255 INFO L225 Difference]: With dead ends: 2923 [2018-07-25 08:38:20,255 INFO L226 Difference]: Without dead ends: 2921 [2018-07-25 08:38:20,256 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:38:20,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2018-07-25 08:38:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2165. [2018-07-25 08:38:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2165 states. [2018-07-25 08:38:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3628 transitions. [2018-07-25 08:38:21,302 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3628 transitions. Word has length 19 [2018-07-25 08:38:21,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:21,302 INFO L472 AbstractCegarLoop]: Abstraction has 2165 states and 3628 transitions. [2018-07-25 08:38:21,302 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:38:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3628 transitions. [2018-07-25 08:38:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:21,304 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:21,304 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:21,304 INFO L415 AbstractCegarLoop]: === Iteration 88 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:21,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1180644619, now seen corresponding path program 1 times [2018-07-25 08:38:21,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:21,320 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:21,321 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:21,321 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:21,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:21,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:21,321 INFO L87 Difference]: Start difference. First operand 2165 states and 3628 transitions. Second operand 12 states. [2018-07-25 08:38:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:22,955 INFO L93 Difference]: Finished difference Result 2392 states and 3991 transitions. [2018-07-25 08:38:22,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:38:22,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 08:38:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:22,958 INFO L225 Difference]: With dead ends: 2392 [2018-07-25 08:38:22,958 INFO L226 Difference]: Without dead ends: 2391 [2018-07-25 08:38:22,959 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=249, Invalid=1157, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:38:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2018-07-25 08:38:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2238. [2018-07-25 08:38:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2238 states. [2018-07-25 08:38:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3754 transitions. [2018-07-25 08:38:24,146 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3754 transitions. Word has length 19 [2018-07-25 08:38:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:24,146 INFO L472 AbstractCegarLoop]: Abstraction has 2238 states and 3754 transitions. [2018-07-25 08:38:24,147 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3754 transitions. [2018-07-25 08:38:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:24,148 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:24,148 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:24,148 INFO L415 AbstractCegarLoop]: === Iteration 89 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:24,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1537034535, now seen corresponding path program 1 times [2018-07-25 08:38:24,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:24,166 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:24,166 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:24,167 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:24,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:24,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:24,167 INFO L87 Difference]: Start difference. First operand 2238 states and 3754 transitions. Second operand 12 states. [2018-07-25 08:38:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:25,861 INFO L93 Difference]: Finished difference Result 2500 states and 4176 transitions. [2018-07-25 08:38:25,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:38:25,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 08:38:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:25,864 INFO L225 Difference]: With dead ends: 2500 [2018-07-25 08:38:25,864 INFO L226 Difference]: Without dead ends: 2498 [2018-07-25 08:38:25,865 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=464, Invalid=1888, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:38:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2018-07-25 08:38:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2319. [2018-07-25 08:38:27,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2319 states. [2018-07-25 08:38:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3903 transitions. [2018-07-25 08:38:27,050 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3903 transitions. Word has length 19 [2018-07-25 08:38:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:27,050 INFO L472 AbstractCegarLoop]: Abstraction has 2319 states and 3903 transitions. [2018-07-25 08:38:27,050 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3903 transitions. [2018-07-25 08:38:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:27,051 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:27,052 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:27,052 INFO L415 AbstractCegarLoop]: === Iteration 90 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:27,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1313246452, now seen corresponding path program 2 times [2018-07-25 08:38:27,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:27,065 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:27,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:38:27,065 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:38:27,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:38:27,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:38:27,066 INFO L87 Difference]: Start difference. First operand 2319 states and 3903 transitions. Second operand 13 states. [2018-07-25 08:38:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:29,167 INFO L93 Difference]: Finished difference Result 3166 states and 5350 transitions. [2018-07-25 08:38:29,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:38:29,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 08:38:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:29,170 INFO L225 Difference]: With dead ends: 3166 [2018-07-25 08:38:29,170 INFO L226 Difference]: Without dead ends: 3164 [2018-07-25 08:38:29,171 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:38:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2018-07-25 08:38:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 2660. [2018-07-25 08:38:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2018-07-25 08:38:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 4506 transitions. [2018-07-25 08:38:30,552 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 4506 transitions. Word has length 19 [2018-07-25 08:38:30,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:30,553 INFO L472 AbstractCegarLoop]: Abstraction has 2660 states and 4506 transitions. [2018-07-25 08:38:30,553 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:38:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 4506 transitions. [2018-07-25 08:38:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:30,554 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:30,554 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:30,554 INFO L415 AbstractCegarLoop]: === Iteration 91 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:30,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1262707917, now seen corresponding path program 1 times [2018-07-25 08:38:30,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:30,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:30,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:30,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:30,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:30,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:30,572 INFO L87 Difference]: Start difference. First operand 2660 states and 4506 transitions. Second operand 12 states. [2018-07-25 08:38:32,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:32,398 INFO L93 Difference]: Finished difference Result 2926 states and 4919 transitions. [2018-07-25 08:38:32,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:38:32,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 08:38:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:32,401 INFO L225 Difference]: With dead ends: 2926 [2018-07-25 08:38:32,402 INFO L226 Difference]: Without dead ends: 2925 [2018-07-25 08:38:32,402 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:38:32,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2018-07-25 08:38:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2743. [2018-07-25 08:38:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2743 states. [2018-07-25 08:38:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 4635 transitions. [2018-07-25 08:38:33,950 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 4635 transitions. Word has length 19 [2018-07-25 08:38:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:33,951 INFO L472 AbstractCegarLoop]: Abstraction has 2743 states and 4635 transitions. [2018-07-25 08:38:33,951 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 4635 transitions. [2018-07-25 08:38:33,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:33,952 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:33,952 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:33,952 INFO L415 AbstractCegarLoop]: === Iteration 92 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:33,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1454971237, now seen corresponding path program 1 times [2018-07-25 08:38:33,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:33,969 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:33,969 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:33,969 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:33,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:33,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:33,969 INFO L87 Difference]: Start difference. First operand 2743 states and 4635 transitions. Second operand 12 states. [2018-07-25 08:38:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:36,214 INFO L93 Difference]: Finished difference Result 3133 states and 5275 transitions. [2018-07-25 08:38:36,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:38:36,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 08:38:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:36,218 INFO L225 Difference]: With dead ends: 3133 [2018-07-25 08:38:36,218 INFO L226 Difference]: Without dead ends: 3131 [2018-07-25 08:38:36,219 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:38:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2018-07-25 08:38:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2801. [2018-07-25 08:38:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2018-07-25 08:38:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4743 transitions. [2018-07-25 08:38:38,006 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4743 transitions. Word has length 19 [2018-07-25 08:38:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:38,006 INFO L472 AbstractCegarLoop]: Abstraction has 2801 states and 4743 transitions. [2018-07-25 08:38:38,006 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4743 transitions. [2018-07-25 08:38:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:38,007 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:38,008 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:38,008 INFO L415 AbstractCegarLoop]: === Iteration 93 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:38,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1425507486, now seen corresponding path program 1 times [2018-07-25 08:38:38,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:38,021 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:38,021 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:38,021 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:38,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:38,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:38,021 INFO L87 Difference]: Start difference. First operand 2801 states and 4743 transitions. Second operand 12 states. [2018-07-25 08:38:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:39,850 INFO L93 Difference]: Finished difference Result 2901 states and 4876 transitions. [2018-07-25 08:38:39,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:38:39,850 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-25 08:38:39,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:39,853 INFO L225 Difference]: With dead ends: 2901 [2018-07-25 08:38:39,854 INFO L226 Difference]: Without dead ends: 2899 [2018-07-25 08:38:39,854 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:38:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2018-07-25 08:38:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2806. [2018-07-25 08:38:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states. [2018-07-25 08:38:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 4747 transitions. [2018-07-25 08:38:41,472 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 4747 transitions. Word has length 19 [2018-07-25 08:38:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:41,473 INFO L472 AbstractCegarLoop]: Abstraction has 2806 states and 4747 transitions. [2018-07-25 08:38:41,473 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4747 transitions. [2018-07-25 08:38:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:38:41,474 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:41,474 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:41,474 INFO L415 AbstractCegarLoop]: === Iteration 94 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:41,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1340518044, now seen corresponding path program 3 times [2018-07-25 08:38:41,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:41,494 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:41,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:38:41,494 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:38:41,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:38:41,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:38:41,495 INFO L87 Difference]: Start difference. First operand 2806 states and 4747 transitions. Second operand 13 states. [2018-07-25 08:38:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:43,471 INFO L93 Difference]: Finished difference Result 2882 states and 4840 transitions. [2018-07-25 08:38:43,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:38:43,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-25 08:38:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:43,474 INFO L225 Difference]: With dead ends: 2882 [2018-07-25 08:38:43,474 INFO L226 Difference]: Without dead ends: 2881 [2018-07-25 08:38:43,474 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:38:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2018-07-25 08:38:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2808. [2018-07-25 08:38:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2018-07-25 08:38:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4749 transitions. [2018-07-25 08:38:45,036 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4749 transitions. Word has length 19 [2018-07-25 08:38:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:45,036 INFO L472 AbstractCegarLoop]: Abstraction has 2808 states and 4749 transitions. [2018-07-25 08:38:45,036 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:38:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4749 transitions. [2018-07-25 08:38:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:38:45,037 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:45,038 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:45,038 INFO L415 AbstractCegarLoop]: === Iteration 95 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:45,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1920603351, now seen corresponding path program 2 times [2018-07-25 08:38:45,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:45,051 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:45,051 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:45,052 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:38:45,052 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:38:45,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:38:45,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:38:45,052 INFO L87 Difference]: Start difference. First operand 2808 states and 4749 transitions. Second operand 13 states. [2018-07-25 08:38:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:46,931 INFO L93 Difference]: Finished difference Result 2926 states and 4924 transitions. [2018-07-25 08:38:46,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:38:46,931 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-07-25 08:38:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:46,934 INFO L225 Difference]: With dead ends: 2926 [2018-07-25 08:38:46,934 INFO L226 Difference]: Without dead ends: 2924 [2018-07-25 08:38:46,935 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:38:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2018-07-25 08:38:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2802. [2018-07-25 08:38:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2018-07-25 08:38:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4737 transitions. [2018-07-25 08:38:48,552 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4737 transitions. Word has length 21 [2018-07-25 08:38:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:48,552 INFO L472 AbstractCegarLoop]: Abstraction has 2802 states and 4737 transitions. [2018-07-25 08:38:48,552 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:38:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4737 transitions. [2018-07-25 08:38:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:38:48,554 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:48,554 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:48,554 INFO L415 AbstractCegarLoop]: === Iteration 96 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:48,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1322152835, now seen corresponding path program 1 times [2018-07-25 08:38:48,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:48,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:48,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:48,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:48,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:48,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:48,572 INFO L87 Difference]: Start difference. First operand 2802 states and 4737 transitions. Second operand 12 states. [2018-07-25 08:38:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:50,455 INFO L93 Difference]: Finished difference Result 2956 states and 4972 transitions. [2018-07-25 08:38:50,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:38:50,455 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:38:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:50,458 INFO L225 Difference]: With dead ends: 2956 [2018-07-25 08:38:50,458 INFO L226 Difference]: Without dead ends: 2954 [2018-07-25 08:38:50,459 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:38:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-07-25 08:38:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2817. [2018-07-25 08:38:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2018-07-25 08:38:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4761 transitions. [2018-07-25 08:38:52,090 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 4761 transitions. Word has length 21 [2018-07-25 08:38:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:52,091 INFO L472 AbstractCegarLoop]: Abstraction has 2817 states and 4761 transitions. [2018-07-25 08:38:52,091 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 4761 transitions. [2018-07-25 08:38:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:38:52,092 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:52,092 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:52,092 INFO L415 AbstractCegarLoop]: === Iteration 97 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash 277164812, now seen corresponding path program 1 times [2018-07-25 08:38:52,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:52,104 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:52,104 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:52,105 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:52,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:52,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:52,105 INFO L87 Difference]: Start difference. First operand 2817 states and 4761 transitions. Second operand 12 states. [2018-07-25 08:38:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:54,185 INFO L93 Difference]: Finished difference Result 3140 states and 5289 transitions. [2018-07-25 08:38:54,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:38:54,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:38:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:54,188 INFO L225 Difference]: With dead ends: 3140 [2018-07-25 08:38:54,189 INFO L226 Difference]: Without dead ends: 3138 [2018-07-25 08:38:54,189 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:38:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-07-25 08:38:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2900. [2018-07-25 08:38:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2018-07-25 08:38:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 4905 transitions. [2018-07-25 08:38:55,821 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 4905 transitions. Word has length 21 [2018-07-25 08:38:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:55,822 INFO L472 AbstractCegarLoop]: Abstraction has 2900 states and 4905 transitions. [2018-07-25 08:38:55,822 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4905 transitions. [2018-07-25 08:38:55,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:38:55,823 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:55,823 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:55,824 INFO L415 AbstractCegarLoop]: === Iteration 98 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:55,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2146104337, now seen corresponding path program 2 times [2018-07-25 08:38:55,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:55,834 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:55,835 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:55,835 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:55,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:55,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:55,835 INFO L87 Difference]: Start difference. First operand 2900 states and 4905 transitions. Second operand 12 states. [2018-07-25 08:38:58,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:58,074 INFO L93 Difference]: Finished difference Result 3107 states and 5227 transitions. [2018-07-25 08:38:58,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:38:58,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:38:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:58,077 INFO L225 Difference]: With dead ends: 3107 [2018-07-25 08:38:58,077 INFO L226 Difference]: Without dead ends: 3105 [2018-07-25 08:38:58,078 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:38:58,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2018-07-25 08:38:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 2911. [2018-07-25 08:38:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2018-07-25 08:38:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4924 transitions. [2018-07-25 08:38:59,725 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4924 transitions. Word has length 21 [2018-07-25 08:38:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:59,726 INFO L472 AbstractCegarLoop]: Abstraction has 2911 states and 4924 transitions. [2018-07-25 08:38:59,726 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4924 transitions. [2018-07-25 08:38:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:38:59,727 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:59,727 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:59,728 INFO L415 AbstractCegarLoop]: === Iteration 99 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:59,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1101116314, now seen corresponding path program 2 times [2018-07-25 08:38:59,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:59,738 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:59,738 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:59,738 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:59,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:59,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:59,738 INFO L87 Difference]: Start difference. First operand 2911 states and 4924 transitions. Second operand 12 states. [2018-07-25 08:39:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:01,857 INFO L93 Difference]: Finished difference Result 3164 states and 5332 transitions. [2018-07-25 08:39:01,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:39:01,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:39:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:01,860 INFO L225 Difference]: With dead ends: 3164 [2018-07-25 08:39:01,860 INFO L226 Difference]: Without dead ends: 3162 [2018-07-25 08:39:01,860 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:39:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2018-07-25 08:39:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 2915. [2018-07-25 08:39:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2915 states. [2018-07-25 08:39:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4930 transitions. [2018-07-25 08:39:03,519 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4930 transitions. Word has length 21 [2018-07-25 08:39:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:03,519 INFO L472 AbstractCegarLoop]: Abstraction has 2915 states and 4930 transitions. [2018-07-25 08:39:03,519 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:39:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4930 transitions. [2018-07-25 08:39:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:39:03,520 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:03,521 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:03,521 INFO L415 AbstractCegarLoop]: === Iteration 100 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:03,521 INFO L82 PathProgramCache]: Analyzing trace with hash -825971080, now seen corresponding path program 3 times [2018-07-25 08:39:03,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:03,535 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:03,535 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:39:03,535 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:39:03,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:39:03,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:39:03,536 INFO L87 Difference]: Start difference. First operand 2915 states and 4930 transitions. Second operand 12 states. [2018-07-25 08:39:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:05,788 INFO L93 Difference]: Finished difference Result 3286 states and 5534 transitions. [2018-07-25 08:39:05,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:39:05,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:39:05,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:05,791 INFO L225 Difference]: With dead ends: 3286 [2018-07-25 08:39:05,791 INFO L226 Difference]: Without dead ends: 3284 [2018-07-25 08:39:05,791 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:39:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2018-07-25 08:39:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 2815. [2018-07-25 08:39:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2018-07-25 08:39:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 4765 transitions. [2018-07-25 08:39:07,427 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 4765 transitions. Word has length 21 [2018-07-25 08:39:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:07,427 INFO L472 AbstractCegarLoop]: Abstraction has 2815 states and 4765 transitions. [2018-07-25 08:39:07,427 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:39:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4765 transitions. [2018-07-25 08:39:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:39:07,429 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:07,429 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:39:07,429 INFO L415 AbstractCegarLoop]: === Iteration 101 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:07,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1513598179, now seen corresponding path program 3 times [2018-07-25 08:39:07,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:07,444 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:07,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:39:07,444 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:39:07,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:39:07,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:39:07,445 INFO L87 Difference]: Start difference. First operand 2815 states and 4765 transitions. Second operand 12 states. [2018-07-25 08:39:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:10,080 INFO L93 Difference]: Finished difference Result 3830 states and 6471 transitions. [2018-07-25 08:39:10,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:39:10,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:39:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:10,084 INFO L225 Difference]: With dead ends: 3830 [2018-07-25 08:39:10,084 INFO L226 Difference]: Without dead ends: 3828 [2018-07-25 08:39:10,085 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:39:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2018-07-25 08:39:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3225. [2018-07-25 08:39:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3225 states. [2018-07-25 08:39:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 5464 transitions. [2018-07-25 08:39:11,941 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 5464 transitions. Word has length 21 [2018-07-25 08:39:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:11,941 INFO L472 AbstractCegarLoop]: Abstraction has 3225 states and 5464 transitions. [2018-07-25 08:39:11,941 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:39:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 5464 transitions. [2018-07-25 08:39:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:39:11,943 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:11,943 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:39:11,943 INFO L415 AbstractCegarLoop]: === Iteration 102 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:11,943 INFO L82 PathProgramCache]: Analyzing trace with hash -790589419, now seen corresponding path program 4 times [2018-07-25 08:39:11,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:11,953 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:11,954 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:11,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:39:11,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:39:11,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:39:11,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:39:11,955 INFO L87 Difference]: Start difference. First operand 3225 states and 5464 transitions. Second operand 12 states. [2018-07-25 08:39:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:14,735 INFO L93 Difference]: Finished difference Result 3932 states and 6616 transitions. [2018-07-25 08:39:14,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:39:14,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:39:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:14,739 INFO L225 Difference]: With dead ends: 3932 [2018-07-25 08:39:14,739 INFO L226 Difference]: Without dead ends: 3930 [2018-07-25 08:39:14,740 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:39:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2018-07-25 08:39:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3379. [2018-07-25 08:39:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3379 states. [2018-07-25 08:39:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 5726 transitions. [2018-07-25 08:39:16,663 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 5726 transitions. Word has length 21 [2018-07-25 08:39:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:16,663 INFO L472 AbstractCegarLoop]: Abstraction has 3379 states and 5726 transitions. [2018-07-25 08:39:16,663 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:39:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 5726 transitions. [2018-07-25 08:39:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:39:16,664 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:16,664 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:39:16,665 INFO L415 AbstractCegarLoop]: === Iteration 103 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:16,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1656473859, now seen corresponding path program 1 times [2018-07-25 08:39:16,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:16,681 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:16,681 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:39:16,682 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:39:16,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:39:16,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:39:16,682 INFO L87 Difference]: Start difference. First operand 3379 states and 5726 transitions. Second operand 12 states. [2018-07-25 08:39:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:19,819 INFO L93 Difference]: Finished difference Result 4115 states and 6953 transitions. [2018-07-25 08:39:19,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:39:19,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:39:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:19,823 INFO L225 Difference]: With dead ends: 4115 [2018-07-25 08:39:19,823 INFO L226 Difference]: Without dead ends: 4113 [2018-07-25 08:39:19,824 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:39:19,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2018-07-25 08:39:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3490. [2018-07-25 08:39:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2018-07-25 08:39:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 5892 transitions. [2018-07-25 08:39:21,834 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 5892 transitions. Word has length 21 [2018-07-25 08:39:21,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:21,834 INFO L472 AbstractCegarLoop]: Abstraction has 3490 states and 5892 transitions. [2018-07-25 08:39:21,834 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:39:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 5892 transitions. [2018-07-25 08:39:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:39:21,835 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:21,836 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:39:21,836 INFO L415 AbstractCegarLoop]: === Iteration 104 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1656474147, now seen corresponding path program 5 times [2018-07-25 08:39:21,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:21,852 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:21,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:39:21,853 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:39:21,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:39:21,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:39:21,853 INFO L87 Difference]: Start difference. First operand 3490 states and 5892 transitions. Second operand 12 states. [2018-07-25 08:39:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:25,026 INFO L93 Difference]: Finished difference Result 4077 states and 6809 transitions. [2018-07-25 08:39:25,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:39:25,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:39:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:25,030 INFO L225 Difference]: With dead ends: 4077 [2018-07-25 08:39:25,030 INFO L226 Difference]: Without dead ends: 4075 [2018-07-25 08:39:25,031 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=357, Invalid=1203, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:39:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2018-07-25 08:39:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 3523. [2018-07-25 08:39:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2018-07-25 08:39:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 5952 transitions. [2018-07-25 08:39:27,084 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 5952 transitions. Word has length 21 [2018-07-25 08:39:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:27,084 INFO L472 AbstractCegarLoop]: Abstraction has 3523 states and 5952 transitions. [2018-07-25 08:39:27,084 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:39:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 5952 transitions. [2018-07-25 08:39:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:39:27,085 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:27,085 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:39:27,086 INFO L415 AbstractCegarLoop]: === Iteration 105 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:27,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1665062316, now seen corresponding path program 2 times [2018-07-25 08:39:27,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:27,101 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:27,101 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:39:27,101 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:39:27,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:39:27,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:39:27,101 INFO L87 Difference]: Start difference. First operand 3523 states and 5952 transitions. Second operand 13 states. [2018-07-25 08:39:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:30,510 INFO L93 Difference]: Finished difference Result 4708 states and 7968 transitions. [2018-07-25 08:39:30,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:39:30,511 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-07-25 08:39:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:30,515 INFO L225 Difference]: With dead ends: 4708 [2018-07-25 08:39:30,515 INFO L226 Difference]: Without dead ends: 4706 [2018-07-25 08:39:30,516 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:39:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4706 states. [2018-07-25 08:39:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4706 to 3926. [2018-07-25 08:39:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3926 states. [2018-07-25 08:39:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 6652 transitions. [2018-07-25 08:39:32,750 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 6652 transitions. Word has length 21 [2018-07-25 08:39:32,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:32,750 INFO L472 AbstractCegarLoop]: Abstraction has 3926 states and 6652 transitions. [2018-07-25 08:39:32,750 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:39:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 6652 transitions. [2018-07-25 08:39:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:39:32,752 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:32,752 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:32,752 INFO L415 AbstractCegarLoop]: === Iteration 106 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:32,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1944645353, now seen corresponding path program 1 times [2018-07-25 08:39:32,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:32,764 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:32,764 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:39:32,764 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:39:32,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:39:32,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:39:32,765 INFO L87 Difference]: Start difference. First operand 3926 states and 6652 transitions. Second operand 12 states. [2018-07-25 08:39:36,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:36,102 INFO L93 Difference]: Finished difference Result 4890 states and 8270 transitions. [2018-07-25 08:39:36,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:39:36,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:39:36,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:36,107 INFO L225 Difference]: With dead ends: 4890 [2018-07-25 08:39:36,108 INFO L226 Difference]: Without dead ends: 4888 [2018-07-25 08:39:36,109 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:39:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4888 states. [2018-07-25 08:39:38,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4888 to 4312. [2018-07-25 08:39:38,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4312 states. [2018-07-25 08:39:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 7318 transitions. [2018-07-25 08:39:38,576 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 7318 transitions. Word has length 21 [2018-07-25 08:39:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:38,576 INFO L472 AbstractCegarLoop]: Abstraction has 4312 states and 7318 transitions. [2018-07-25 08:39:38,576 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:39:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 7318 transitions. [2018-07-25 08:39:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:39:38,577 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:38,577 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:38,578 INFO L415 AbstractCegarLoop]: === Iteration 107 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:38,578 INFO L82 PathProgramCache]: Analyzing trace with hash 502417925, now seen corresponding path program 1 times [2018-07-25 08:39:38,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:38,591 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:38,591 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:39:38,591 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:39:38,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:39:38,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:39:38,592 INFO L87 Difference]: Start difference. First operand 4312 states and 7318 transitions. Second operand 12 states. [2018-07-25 08:39:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:42,082 INFO L93 Difference]: Finished difference Result 5047 states and 8540 transitions. [2018-07-25 08:39:42,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:39:42,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:39:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:42,087 INFO L225 Difference]: With dead ends: 5047 [2018-07-25 08:39:42,087 INFO L226 Difference]: Without dead ends: 5045 [2018-07-25 08:39:42,088 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:39:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2018-07-25 08:39:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 4470. [2018-07-25 08:39:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4470 states. [2018-07-25 08:39:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 7567 transitions. [2018-07-25 08:39:44,674 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 7567 transitions. Word has length 21 [2018-07-25 08:39:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:44,674 INFO L472 AbstractCegarLoop]: Abstraction has 4470 states and 7567 transitions. [2018-07-25 08:39:44,674 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:39:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 7567 transitions. [2018-07-25 08:39:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:39:44,676 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:44,676 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:44,676 INFO L415 AbstractCegarLoop]: === Iteration 108 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:44,676 INFO L82 PathProgramCache]: Analyzing trace with hash 502418213, now seen corresponding path program 2 times [2018-07-25 08:39:44,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:44,692 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:44,692 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:39:44,692 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:39:44,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:39:44,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:39:44,693 INFO L87 Difference]: Start difference. First operand 4470 states and 7567 transitions. Second operand 12 states. [2018-07-25 08:39:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:48,316 INFO L93 Difference]: Finished difference Result 5152 states and 8677 transitions. [2018-07-25 08:39:48,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:39:48,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:39:48,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:48,321 INFO L225 Difference]: With dead ends: 5152 [2018-07-25 08:39:48,321 INFO L226 Difference]: Without dead ends: 5150 [2018-07-25 08:39:48,322 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:39:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2018-07-25 08:39:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 4477. [2018-07-25 08:39:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4477 states. [2018-07-25 08:39:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 7584 transitions. [2018-07-25 08:39:50,852 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 7584 transitions. Word has length 21 [2018-07-25 08:39:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:50,852 INFO L472 AbstractCegarLoop]: Abstraction has 4477 states and 7584 transitions. [2018-07-25 08:39:50,852 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:39:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 7584 transitions. [2018-07-25 08:39:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:39:50,853 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:50,854 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:50,854 INFO L415 AbstractCegarLoop]: === Iteration 109 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:50,854 INFO L82 PathProgramCache]: Analyzing trace with hash 511006382, now seen corresponding path program 2 times [2018-07-25 08:39:50,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:50,865 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:50,865 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:39:50,866 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:39:50,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:39:50,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:39:50,866 INFO L87 Difference]: Start difference. First operand 4477 states and 7584 transitions. Second operand 13 states. [2018-07-25 08:39:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:54,692 INFO L93 Difference]: Finished difference Result 5562 states and 9455 transitions. [2018-07-25 08:39:54,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:39:54,692 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-07-25 08:39:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:54,698 INFO L225 Difference]: With dead ends: 5562 [2018-07-25 08:39:54,698 INFO L226 Difference]: Without dead ends: 5560 [2018-07-25 08:39:54,700 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:39:54,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states. [2018-07-25 08:39:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 4895. [2018-07-25 08:39:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4895 states. [2018-07-25 08:39:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 8338 transitions. [2018-07-25 08:39:57,544 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 8338 transitions. Word has length 21 [2018-07-25 08:39:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:57,544 INFO L472 AbstractCegarLoop]: Abstraction has 4895 states and 8338 transitions. [2018-07-25 08:39:57,544 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:39:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 8338 transitions. [2018-07-25 08:39:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:39:57,546 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:57,546 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:57,546 INFO L415 AbstractCegarLoop]: === Iteration 110 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1892744866, now seen corresponding path program 1 times [2018-07-25 08:39:57,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:57,559 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:57,559 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:39:57,560 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:39:57,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:39:57,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:39:57,560 INFO L87 Difference]: Start difference. First operand 4895 states and 8338 transitions. Second operand 12 states. [2018-07-25 08:40:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:01,508 INFO L93 Difference]: Finished difference Result 5795 states and 9885 transitions. [2018-07-25 08:40:01,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:40:01,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:40:01,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:01,513 INFO L225 Difference]: With dead ends: 5795 [2018-07-25 08:40:01,514 INFO L226 Difference]: Without dead ends: 5793 [2018-07-25 08:40:01,515 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:40:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states. [2018-07-25 08:40:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5793 to 5351. [2018-07-25 08:40:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5351 states. [2018-07-25 08:40:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5351 states to 5351 states and 9168 transitions. [2018-07-25 08:40:04,666 INFO L78 Accepts]: Start accepts. Automaton has 5351 states and 9168 transitions. Word has length 21 [2018-07-25 08:40:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:04,666 INFO L472 AbstractCegarLoop]: Abstraction has 5351 states and 9168 transitions. [2018-07-25 08:40:04,666 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:40:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5351 states and 9168 transitions. [2018-07-25 08:40:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:40:04,668 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:04,668 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:40:04,668 INFO L415 AbstractCegarLoop]: === Iteration 111 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1195981155, now seen corresponding path program 3 times [2018-07-25 08:40:04,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:04,683 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:04,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:40:04,683 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:40:04,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:40:04,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:40:04,684 INFO L87 Difference]: Start difference. First operand 5351 states and 9168 transitions. Second operand 12 states. [2018-07-25 08:40:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:09,027 INFO L93 Difference]: Finished difference Result 6216 states and 10633 transitions. [2018-07-25 08:40:09,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:40:09,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:40:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:09,034 INFO L225 Difference]: With dead ends: 6216 [2018-07-25 08:40:09,035 INFO L226 Difference]: Without dead ends: 6214 [2018-07-25 08:40:09,036 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:40:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2018-07-25 08:40:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 5792. [2018-07-25 08:40:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5792 states. [2018-07-25 08:40:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5792 states to 5792 states and 9945 transitions. [2018-07-25 08:40:12,487 INFO L78 Accepts]: Start accepts. Automaton has 5792 states and 9945 transitions. Word has length 21 [2018-07-25 08:40:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:12,487 INFO L472 AbstractCegarLoop]: Abstraction has 5792 states and 9945 transitions. [2018-07-25 08:40:12,487 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:40:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 5792 states and 9945 transitions. [2018-07-25 08:40:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:40:12,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:12,490 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:40:12,490 INFO L415 AbstractCegarLoop]: === Iteration 112 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:12,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1244712345, now seen corresponding path program 1 times [2018-07-25 08:40:12,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:40:12,503 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:12,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:40:12,504 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:40:12,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:40:12,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:40:12,504 INFO L87 Difference]: Start difference. First operand 5792 states and 9945 transitions. Second operand 12 states. [2018-07-25 08:40:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:17,470 INFO L93 Difference]: Finished difference Result 6775 states and 11608 transitions. [2018-07-25 08:40:17,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:40:17,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:40:17,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:17,478 INFO L225 Difference]: With dead ends: 6775 [2018-07-25 08:40:17,478 INFO L226 Difference]: Without dead ends: 6773 [2018-07-25 08:40:17,480 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=408, Invalid=1232, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:40:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2018-07-25 08:40:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 5546. [2018-07-25 08:40:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5546 states. [2018-07-25 08:40:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5546 states to 5546 states and 9498 transitions. [2018-07-25 08:40:20,995 INFO L78 Accepts]: Start accepts. Automaton has 5546 states and 9498 transitions. Word has length 21 [2018-07-25 08:40:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:20,995 INFO L472 AbstractCegarLoop]: Abstraction has 5546 states and 9498 transitions. [2018-07-25 08:40:20,995 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:40:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 5546 states and 9498 transitions. [2018-07-25 08:40:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:40:20,996 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:20,997 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:40:20,997 INFO L415 AbstractCegarLoop]: === Iteration 113 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2122062335, now seen corresponding path program 6 times [2018-07-25 08:40:20,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:21,010 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:21,010 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:40:21,010 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:40:21,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:40:21,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:40:21,011 INFO L87 Difference]: Start difference. First operand 5546 states and 9498 transitions. Second operand 12 states. [2018-07-25 08:40:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:27,080 INFO L93 Difference]: Finished difference Result 7993 states and 13790 transitions. [2018-07-25 08:40:27,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:40:27,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:40:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:27,086 INFO L225 Difference]: With dead ends: 7993 [2018-07-25 08:40:27,087 INFO L226 Difference]: Without dead ends: 7991 [2018-07-25 08:40:27,087 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:40:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states. [2018-07-25 08:40:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 6894. [2018-07-25 08:40:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6894 states. [2018-07-25 08:40:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11875 transitions. [2018-07-25 08:40:31,339 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11875 transitions. Word has length 21 [2018-07-25 08:40:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:31,340 INFO L472 AbstractCegarLoop]: Abstraction has 6894 states and 11875 transitions. [2018-07-25 08:40:31,340 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:40:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11875 transitions. [2018-07-25 08:40:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:40:31,341 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:31,341 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:40:31,342 INFO L415 AbstractCegarLoop]: === Iteration 114 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash 274158317, now seen corresponding path program 3 times [2018-07-25 08:40:31,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:31,354 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:31,354 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:40:31,354 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:40:31,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:40:31,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:40:31,355 INFO L87 Difference]: Start difference. First operand 6894 states and 11875 transitions. Second operand 12 states. [2018-07-25 08:40:37,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:37,869 INFO L93 Difference]: Finished difference Result 8437 states and 14562 transitions. [2018-07-25 08:40:37,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:40:37,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:40:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:37,878 INFO L225 Difference]: With dead ends: 8437 [2018-07-25 08:40:37,878 INFO L226 Difference]: Without dead ends: 8435 [2018-07-25 08:40:37,880 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:40:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8435 states. [2018-07-25 08:40:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8435 to 7260. [2018-07-25 08:40:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states. [2018-07-25 08:40:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 12485 transitions. [2018-07-25 08:40:42,390 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 12485 transitions. Word has length 21 [2018-07-25 08:40:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:42,391 INFO L472 AbstractCegarLoop]: Abstraction has 7260 states and 12485 transitions. [2018-07-25 08:40:42,391 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:40:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 12485 transitions. [2018-07-25 08:40:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:40:42,392 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:42,392 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:40:42,393 INFO L415 AbstractCegarLoop]: === Iteration 115 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:42,393 INFO L82 PathProgramCache]: Analyzing trace with hash 274158605, now seen corresponding path program 7 times [2018-07-25 08:40:42,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:42,404 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:42,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:40:42,404 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:40:42,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:40:42,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:40:42,405 INFO L87 Difference]: Start difference. First operand 7260 states and 12485 transitions. Second operand 12 states. [2018-07-25 08:40:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:49,153 INFO L93 Difference]: Finished difference Result 8575 states and 14718 transitions. [2018-07-25 08:40:49,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:40:49,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:40:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:49,160 INFO L225 Difference]: With dead ends: 8575 [2018-07-25 08:40:49,161 INFO L226 Difference]: Without dead ends: 8573 [2018-07-25 08:40:49,162 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:40:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8573 states. [2018-07-25 08:40:53,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8573 to 7185. [2018-07-25 08:40:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7185 states. [2018-07-25 08:40:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 12367 transitions. [2018-07-25 08:40:53,642 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 12367 transitions. Word has length 21 [2018-07-25 08:40:53,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:53,642 INFO L472 AbstractCegarLoop]: Abstraction has 7185 states and 12367 transitions. [2018-07-25 08:40:53,642 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:40:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 12367 transitions. [2018-07-25 08:40:53,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:40:53,644 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:53,644 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:40:53,644 INFO L415 AbstractCegarLoop]: === Iteration 116 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:53,644 INFO L82 PathProgramCache]: Analyzing trace with hash 282746774, now seen corresponding path program 4 times [2018-07-25 08:40:53,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:53,657 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:53,657 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:40:53,657 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:40:53,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:40:53,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:40:53,658 INFO L87 Difference]: Start difference. First operand 7185 states and 12367 transitions. Second operand 12 states. [2018-07-25 08:41:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:00,157 INFO L93 Difference]: Finished difference Result 9004 states and 15545 transitions. [2018-07-25 08:41:00,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:41:00,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:41:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:00,167 INFO L225 Difference]: With dead ends: 9004 [2018-07-25 08:41:00,167 INFO L226 Difference]: Without dead ends: 9002 [2018-07-25 08:41:00,169 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:41:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9002 states. [2018-07-25 08:41:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9002 to 8158. [2018-07-25 08:41:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8158 states. [2018-07-25 08:41:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 14063 transitions. [2018-07-25 08:41:05,174 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 14063 transitions. Word has length 21 [2018-07-25 08:41:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:05,175 INFO L472 AbstractCegarLoop]: Abstraction has 8158 states and 14063 transitions. [2018-07-25 08:41:05,175 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:41:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 14063 transitions. [2018-07-25 08:41:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:41:05,176 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:05,176 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:41:05,177 INFO L415 AbstractCegarLoop]: === Iteration 117 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2121004474, now seen corresponding path program 1 times [2018-07-25 08:41:05,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:05,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:05,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:41:05,188 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:41:05,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:41:05,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:41:05,189 INFO L87 Difference]: Start difference. First operand 8158 states and 14063 transitions. Second operand 12 states. Received shutdown request... [2018-07-25 08:41:07,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:41:07,017 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:41:07,023 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:41:07,024 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:41:07 BoogieIcfgContainer [2018-07-25 08:41:07,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:41:07,025 INFO L168 Benchmark]: Toolchain (without parser) took 257373.49 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -663.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-07-25 08:41:07,026 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:41:07,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:41:07,027 INFO L168 Benchmark]: Boogie Preprocessor took 21.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:41:07,027 INFO L168 Benchmark]: RCFGBuilder took 286.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:41:07,028 INFO L168 Benchmark]: TraceAbstraction took 257020.71 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -674.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-07-25 08:41:07,031 INFO L336 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 286.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 257020.71 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -674.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (8158states) and interpolant automaton (currently 24 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (1634 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (8158states) and interpolant automaton (currently 24 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (1634 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 78). Cancelled while BasicCegarLoop was constructing difference of abstraction (8158states) and interpolant automaton (currently 24 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (1634 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (8158states) and interpolant automaton (currently 24 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (1634 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 256.9s OverallTime, 117 OverallIterations, 4 TraceHistogramMax, 150.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4265 SDtfs, 10993 SDslu, 9309 SDs, 0 SdLazy, 62260 SolverSat, 5461 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2583 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 2488 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12447 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8158occurred in iteration=116, 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: 104.1s AutomataMinimizationTime, 116 MinimizatonAttempts, 24449 StatesRemovedByMinimization, 116 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1792 NumberOfCodeBlocks, 1792 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 1675 ConstructedInterpolants, 0 QuantifiedInterpolants, 172814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 117 InterpolantComputations, 7 PerfectInterpolantSequences, 135/1170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-41-07-041.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-41-07-041.csv Completed graceful shutdown