java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:13,733 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:13,737 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:13,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:13,756 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:13,757 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:13,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:13,760 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:13,766 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:13,767 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:13,768 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:13,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:13,769 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:13,770 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:13,771 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:13,772 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:13,773 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:13,775 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:13,777 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:13,779 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:13,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:13,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:13,784 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:13,784 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:13,784 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:13,786 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:13,787 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:13,787 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:13,788 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:13,789 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:13,790 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:13,790 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:13,790 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:13,791 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:13,792 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:13,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:13,793 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:06:13,802 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:13,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:13,809 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:13,809 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:13,809 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:13,809 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:13,810 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:13,810 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:13,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:13,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:13,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:13,879 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:13,880 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:13,880 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2018-09-26 08:06:13,880 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-09-26 08:06:13,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:13,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:13,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:13,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:13,957 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:13,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:13" (1/1) ... [2018-09-26 08:06:13,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:13" (1/1) ... [2018-09-26 08:06:14,006 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:06:14,006 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:06:14,007 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:06:14,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:14,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:14,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:14,010 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:14,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:13" (1/1) ... [2018-09-26 08:06:14,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:13" (1/1) ... [2018-09-26 08:06:14,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:13" (1/1) ... [2018-09-26 08:06:14,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:13" (1/1) ... [2018-09-26 08:06:14,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:13" (1/1) ... [2018-09-26 08:06:14,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:13" (1/1) ... [2018-09-26 08:06:14,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:13" (1/1) ... [2018-09-26 08:06:14,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:14,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:14,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:14,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:14,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:13" (1/1) ... [2018-09-26 08:06:14,142 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 08:06:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 08:06:14,143 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 08:06:14,490 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:06:14,491 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:14 BoogieIcfgContainer [2018-09-26 08:06:14,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:14,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:14,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:14,497 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:14,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:13" (1/2) ... [2018-09-26 08:06:14,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6defd2db and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:06:14, skipping insertion in model container [2018-09-26 08:06:14,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:14" (2/2) ... [2018-09-26 08:06:14,506 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-09-26 08:06:14,519 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:14,526 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-26 08:06:14,582 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:14,583 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:14,583 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:14,583 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:14,584 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:14,584 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:14,584 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:14,584 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:14,586 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-26 08:06:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:14,619 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,620 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:14,622 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-26 08:06:14,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:14,769 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:14,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:14,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:14,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:14,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:14,792 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-26 08:06:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:15,422 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-26 08:06:15,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:06:15,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 08:06:15,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:15,443 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:06:15,443 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:06:15,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:06:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-26 08:06:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:06:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-26 08:06:15,519 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-26 08:06:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:15,520 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-26 08:06:15,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-26 08:06:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:15,521 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:15,521 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:15,522 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:15,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:15,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-26 08:06:15,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:15,543 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:15,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:15,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:15,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:15,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:15,546 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-26 08:06:15,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:15,964 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-26 08:06:15,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:06:15,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 08:06:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:15,970 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:06:15,970 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:06:15,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:06:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-26 08:06:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:06:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-26 08:06:16,020 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-26 08:06:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,022 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-26 08:06:16,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-26 08:06:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:16,024 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,024 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:16,026 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,028 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-26 08:06:16,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:16,067 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:16,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:16,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:16,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:16,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:16,072 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-26 08:06:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:16,418 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-09-26 08:06:16,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:16,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-26 08:06:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:16,425 INFO L225 Difference]: With dead ends: 283 [2018-09-26 08:06:16,425 INFO L226 Difference]: Without dead ends: 278 [2018-09-26 08:06:16,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 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-09-26 08:06:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-26 08:06:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-09-26 08:06:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:06:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-09-26 08:06:16,472 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-09-26 08:06:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,472 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-09-26 08:06:16,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-09-26 08:06:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:16,477 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,478 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:16,479 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-26 08:06:16,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:16,518 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:16,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:16,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:16,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:16,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:16,520 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-09-26 08:06:16,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:16,865 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-09-26 08:06:16,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:16,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-26 08:06:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:16,869 INFO L225 Difference]: With dead ends: 387 [2018-09-26 08:06:16,869 INFO L226 Difference]: Without dead ends: 375 [2018-09-26 08:06:16,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:16,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-26 08:06:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-09-26 08:06:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:06:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-26 08:06:16,940 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-26 08:06:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,941 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-26 08:06:16,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:16,941 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-26 08:06:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:16,946 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:16,947 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-26 08:06:16,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:16,986 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:16,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:16,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:16,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:16,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:16,990 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-09-26 08:06:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:17,945 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-09-26 08:06:17,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:17,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:17,952 INFO L225 Difference]: With dead ends: 725 [2018-09-26 08:06:17,952 INFO L226 Difference]: Without dead ends: 717 [2018-09-26 08:06:17,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-09-26 08:06:18,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-09-26 08:06:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-26 08:06:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-09-26 08:06:18,060 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-09-26 08:06:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:18,061 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-09-26 08:06:18,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-09-26 08:06:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:18,063 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:18,063 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:18,064 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:18,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:18,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-26 08:06:18,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:18,086 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:18,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:18,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:18,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:18,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:18,088 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-09-26 08:06:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:19,304 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-09-26 08:06:19,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:06:19,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:19,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:19,312 INFO L225 Difference]: With dead ends: 1008 [2018-09-26 08:06:19,312 INFO L226 Difference]: Without dead ends: 1000 [2018-09-26 08:06:19,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:06:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-09-26 08:06:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-09-26 08:06:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-09-26 08:06:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-09-26 08:06:19,443 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-09-26 08:06:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:19,443 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-09-26 08:06:19,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-09-26 08:06:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:19,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:19,445 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:19,446 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:19,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:19,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-26 08:06:19,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:19,465 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:19,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:19,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:19,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:19,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:19,466 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-09-26 08:06:20,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:20,604 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-09-26 08:06:20,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:06:20,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:20,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:20,611 INFO L225 Difference]: With dead ends: 924 [2018-09-26 08:06:20,611 INFO L226 Difference]: Without dead ends: 916 [2018-09-26 08:06:20,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:06:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-09-26 08:06:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-09-26 08:06:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-26 08:06:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-09-26 08:06:20,757 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-09-26 08:06:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:20,758 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-09-26 08:06:20,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-09-26 08:06:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:20,759 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:20,759 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:20,760 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:20,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:20,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-26 08:06:20,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:20,777 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:20,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:20,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:20,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:20,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:20,778 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-09-26 08:06:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:21,769 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-09-26 08:06:21,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:21,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:21,775 INFO L225 Difference]: With dead ends: 791 [2018-09-26 08:06:21,776 INFO L226 Difference]: Without dead ends: 783 [2018-09-26 08:06:21,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:21,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-09-26 08:06:21,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-09-26 08:06:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-09-26 08:06:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-09-26 08:06:21,979 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-09-26 08:06:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:21,985 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-09-26 08:06:21,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-09-26 08:06:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:21,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:21,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:21,987 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:21,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:21,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-09-26 08:06:21,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:22,019 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:22,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:22,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:22,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:22,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:22,022 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-09-26 08:06:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:23,264 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-09-26 08:06:23,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:06:23,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:23,272 INFO L225 Difference]: With dead ends: 1040 [2018-09-26 08:06:23,273 INFO L226 Difference]: Without dead ends: 1032 [2018-09-26 08:06:23,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:06:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-09-26 08:06:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-09-26 08:06:23,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-26 08:06:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-09-26 08:06:23,469 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-09-26 08:06:23,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:23,469 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-09-26 08:06:23,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-09-26 08:06:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:23,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:23,471 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:23,471 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:23,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:23,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-09-26 08:06:23,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:23,490 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:23,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:23,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:23,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:23,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:23,491 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-09-26 08:06:24,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:24,941 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-09-26 08:06:24,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:06:24,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:24,950 INFO L225 Difference]: With dead ends: 1166 [2018-09-26 08:06:24,950 INFO L226 Difference]: Without dead ends: 1158 [2018-09-26 08:06:24,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:06:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-09-26 08:06:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-09-26 08:06:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-26 08:06:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-09-26 08:06:25,156 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-09-26 08:06:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:25,157 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-09-26 08:06:25,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-09-26 08:06:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:25,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:25,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:25,159 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:25,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:25,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-09-26 08:06:25,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:25,175 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:25,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:25,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:25,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:25,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:25,177 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-09-26 08:06:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:26,673 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-09-26 08:06:26,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:06:26,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:26,681 INFO L225 Difference]: With dead ends: 1127 [2018-09-26 08:06:26,681 INFO L226 Difference]: Without dead ends: 1119 [2018-09-26 08:06:26,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:06:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-09-26 08:06:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-09-26 08:06:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-26 08:06:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-09-26 08:06:26,935 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-09-26 08:06:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:26,935 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-09-26 08:06:26,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-09-26 08:06:26,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:26,937 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:26,937 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:26,937 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:26,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-09-26 08:06:26,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:26,951 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:26,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:26,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:26,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:26,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:26,952 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-09-26 08:06:28,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,266 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-09-26 08:06:28,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:06:28,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:28,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,273 INFO L225 Difference]: With dead ends: 975 [2018-09-26 08:06:28,273 INFO L226 Difference]: Without dead ends: 967 [2018-09-26 08:06:28,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:28,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-09-26 08:06:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-09-26 08:06:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-26 08:06:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-09-26 08:06:28,535 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-09-26 08:06:28,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,537 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-09-26 08:06:28,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-09-26 08:06:28,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:28,540 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,540 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:28,540 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,541 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-09-26 08:06:28,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:28,553 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:28,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:28,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:28,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:28,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:28,555 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-09-26 08:06:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,051 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-09-26 08:06:30,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:06:30,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:30,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,058 INFO L225 Difference]: With dead ends: 1011 [2018-09-26 08:06:30,058 INFO L226 Difference]: Without dead ends: 1003 [2018-09-26 08:06:30,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-09-26 08:06:30,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-09-26 08:06:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-26 08:06:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-09-26 08:06:30,344 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-09-26 08:06:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,345 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-09-26 08:06:30,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-09-26 08:06:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:30,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,346 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:30,347 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,347 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-09-26 08:06:30,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:30,362 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:30,363 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:30,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:30,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:30,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:30,364 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-09-26 08:06:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:31,622 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-09-26 08:06:31,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:31,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:06:31,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:31,628 INFO L225 Difference]: With dead ends: 859 [2018-09-26 08:06:31,629 INFO L226 Difference]: Without dead ends: 851 [2018-09-26 08:06:31,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:06:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-09-26 08:06:31,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-09-26 08:06:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-26 08:06:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-26 08:06:31,955 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-26 08:06:31,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:31,956 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-26 08:06:31,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-26 08:06:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:31,957 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:31,957 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:31,957 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:31,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:31,958 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-26 08:06:31,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:31,984 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:31,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:31,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:31,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:31,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:31,986 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-26 08:06:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:33,166 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-09-26 08:06:33,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:33,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:33,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:33,172 INFO L225 Difference]: With dead ends: 962 [2018-09-26 08:06:33,172 INFO L226 Difference]: Without dead ends: 954 [2018-09-26 08:06:33,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:06:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-26 08:06:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-09-26 08:06:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-26 08:06:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-09-26 08:06:33,523 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-09-26 08:06:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:33,524 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-09-26 08:06:33,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-09-26 08:06:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:33,525 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:33,525 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:33,526 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:33,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:33,526 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-09-26 08:06:33,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:33,535 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:33,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:33,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:33,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:33,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:33,536 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-09-26 08:06:34,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:34,992 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-09-26 08:06:34,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:06:34,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:34,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:34,998 INFO L225 Difference]: With dead ends: 1064 [2018-09-26 08:06:34,999 INFO L226 Difference]: Without dead ends: 1056 [2018-09-26 08:06:35,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:06:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-09-26 08:06:35,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-09-26 08:06:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-09-26 08:06:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-09-26 08:06:35,352 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-09-26 08:06:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:35,352 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-09-26 08:06:35,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-09-26 08:06:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:35,353 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:35,353 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:35,354 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:35,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-26 08:06:35,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:35,365 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:35,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:35,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:35,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:35,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:35,366 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-09-26 08:06:36,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:36,853 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-09-26 08:06:36,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:06:36,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:36,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:36,859 INFO L225 Difference]: With dead ends: 1241 [2018-09-26 08:06:36,859 INFO L226 Difference]: Without dead ends: 1233 [2018-09-26 08:06:36,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:06:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-09-26 08:06:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-09-26 08:06:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-26 08:06:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-09-26 08:06:37,262 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-09-26 08:06:37,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:37,263 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-09-26 08:06:37,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-09-26 08:06:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:37,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:37,264 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:37,265 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:37,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:37,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-09-26 08:06:37,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:37,275 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:37,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:37,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:37,276 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-09-26 08:06:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:38,556 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-09-26 08:06:38,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:06:38,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:38,567 INFO L225 Difference]: With dead ends: 1139 [2018-09-26 08:06:38,567 INFO L226 Difference]: Without dead ends: 1131 [2018-09-26 08:06:38,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-09-26 08:06:39,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-09-26 08:06:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-09-26 08:06:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-09-26 08:06:39,034 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-09-26 08:06:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:39,035 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-09-26 08:06:39,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-09-26 08:06:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:39,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:39,036 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:39,036 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:39,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-09-26 08:06:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:39,045 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:39,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:39,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:39,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:39,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:39,046 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-09-26 08:06:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:40,578 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-09-26 08:06:40,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:40,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:40,586 INFO L225 Difference]: With dead ends: 1325 [2018-09-26 08:06:40,586 INFO L226 Difference]: Without dead ends: 1317 [2018-09-26 08:06:40,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-09-26 08:06:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-09-26 08:06:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-09-26 08:06:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-09-26 08:06:40,997 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-09-26 08:06:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:40,997 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-09-26 08:06:40,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-09-26 08:06:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:40,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:40,998 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:40,998 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:40,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:40,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-26 08:06:40,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:41,006 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:41,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:41,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:41,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:41,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:41,007 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-09-26 08:06:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:42,363 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-09-26 08:06:42,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:06:42,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:42,371 INFO L225 Difference]: With dead ends: 1334 [2018-09-26 08:06:42,371 INFO L226 Difference]: Without dead ends: 1326 [2018-09-26 08:06:42,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:06:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-09-26 08:06:42,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-09-26 08:06:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-09-26 08:06:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-09-26 08:06:42,739 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-09-26 08:06:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:42,740 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-09-26 08:06:42,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-09-26 08:06:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:42,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:42,741 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:42,741 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:42,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:42,742 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-09-26 08:06:42,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:42,750 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:42,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:42,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:42,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:42,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:42,751 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-09-26 08:06:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:43,571 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-09-26 08:06:43,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:06:43,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:43,577 INFO L225 Difference]: With dead ends: 919 [2018-09-26 08:06:43,577 INFO L226 Difference]: Without dead ends: 911 [2018-09-26 08:06:43,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-09-26 08:06:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-09-26 08:06:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-26 08:06:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-09-26 08:06:43,987 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-09-26 08:06:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:43,987 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-09-26 08:06:43,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-09-26 08:06:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:43,988 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:43,988 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:43,988 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:43,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:43,988 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-09-26 08:06:43,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:43,997 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:43,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:43,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:43,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:43,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:43,998 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-09-26 08:06:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:45,045 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-09-26 08:06:45,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:45,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:45,052 INFO L225 Difference]: With dead ends: 1095 [2018-09-26 08:06:45,052 INFO L226 Difference]: Without dead ends: 1087 [2018-09-26 08:06:45,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:45,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-09-26 08:06:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-09-26 08:06:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-26 08:06:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-09-26 08:06:45,438 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-09-26 08:06:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:45,439 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-09-26 08:06:45,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-09-26 08:06:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:45,439 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:45,439 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:45,440 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:45,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:45,440 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-09-26 08:06:45,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:45,447 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:45,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:45,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:45,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:45,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:45,448 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-09-26 08:06:47,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:47,018 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-09-26 08:06:47,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:06:47,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:47,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:47,023 INFO L225 Difference]: With dead ends: 1304 [2018-09-26 08:06:47,023 INFO L226 Difference]: Without dead ends: 1296 [2018-09-26 08:06:47,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:06:47,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-26 08:06:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-09-26 08:06:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-09-26 08:06:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-09-26 08:06:47,494 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-09-26 08:06:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:47,494 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-09-26 08:06:47,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-09-26 08:06:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:47,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:47,496 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:47,496 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:47,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:47,496 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-26 08:06:47,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:47,504 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:47,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:47,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:47,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:47,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:47,505 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-09-26 08:06:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:48,886 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-09-26 08:06:48,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:06:48,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:06:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:48,890 INFO L225 Difference]: With dead ends: 1192 [2018-09-26 08:06:48,891 INFO L226 Difference]: Without dead ends: 1184 [2018-09-26 08:06:48,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:06:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-09-26 08:06:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-09-26 08:06:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-26 08:06:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-26 08:06:49,391 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-26 08:06:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:49,391 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-26 08:06:49,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-26 08:06:49,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:49,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:49,392 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:49,393 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:49,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:49,393 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-09-26 08:06:49,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:49,398 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:49,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:49,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:49,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:49,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:49,400 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-26 08:06:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:50,012 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-09-26 08:06:50,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:06:50,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-26 08:06:50,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:50,014 INFO L225 Difference]: With dead ends: 1139 [2018-09-26 08:06:50,014 INFO L226 Difference]: Without dead ends: 625 [2018-09-26 08:06:50,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-09-26 08:06:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-09-26 08:06:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-26 08:06:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-09-26 08:06:50,516 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-09-26 08:06:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:50,516 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-09-26 08:06:50,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-09-26 08:06:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:50,517 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:50,517 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:50,517 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:50,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:50,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-09-26 08:06:50,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:50,542 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:50,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:50,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:50,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:50,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:50,546 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 9 states. [2018-09-26 08:06:51,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:51,664 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-09-26 08:06:51,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:51,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:06:51,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:51,665 INFO L225 Difference]: With dead ends: 794 [2018-09-26 08:06:51,665 INFO L226 Difference]: Without dead ends: 789 [2018-09-26 08:06:51,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-26 08:06:52,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-09-26 08:06:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-09-26 08:06:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-09-26 08:06:52,286 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-09-26 08:06:52,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:52,286 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-09-26 08:06:52,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:52,286 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-09-26 08:06:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:52,287 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:52,287 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:52,288 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:52,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:52,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-09-26 08:06:52,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:52,295 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:52,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:52,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:52,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:52,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:52,296 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-09-26 08:06:52,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:52,958 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-09-26 08:06:52,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:06:52,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-26 08:06:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:52,960 INFO L225 Difference]: With dead ends: 1317 [2018-09-26 08:06:52,960 INFO L226 Difference]: Without dead ends: 729 [2018-09-26 08:06:52,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-09-26 08:06:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-09-26 08:06:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-26 08:06:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-26 08:06:53,625 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-26 08:06:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:53,625 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-26 08:06:53,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-26 08:06:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:53,626 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:53,626 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:53,626 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:53,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:53,627 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-09-26 08:06:53,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:53,637 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:53,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:53,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:53,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:53,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:53,638 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-09-26 08:06:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:56,082 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-09-26 08:06:56,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:06:56,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:06:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:56,085 INFO L225 Difference]: With dead ends: 1435 [2018-09-26 08:06:56,085 INFO L226 Difference]: Without dead ends: 1427 [2018-09-26 08:06:56,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:06:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-09-26 08:06:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-09-26 08:06:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-26 08:06:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-09-26 08:06:56,887 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-09-26 08:06:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:56,887 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-09-26 08:06:56,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-09-26 08:06:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:56,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:56,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:56,889 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:56,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:56,889 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-09-26 08:06:56,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:56,909 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:56,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:56,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:56,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:56,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:56,910 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-09-26 08:06:58,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:58,744 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-09-26 08:06:58,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:06:58,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:06:58,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:58,749 INFO L225 Difference]: With dead ends: 1599 [2018-09-26 08:06:58,749 INFO L226 Difference]: Without dead ends: 1591 [2018-09-26 08:06:58,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:06:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-26 08:06:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-09-26 08:06:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-26 08:06:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-09-26 08:06:59,680 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-09-26 08:06:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,680 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-09-26 08:06:59,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-09-26 08:06:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:59,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:59,681 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:59,681 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:59,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:59,682 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-09-26 08:06:59,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:59,692 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:59,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:06:59,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:59,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:59,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:59,693 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-09-26 08:07:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:01,222 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-09-26 08:07:01,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:01,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:01,226 INFO L225 Difference]: With dead ends: 1411 [2018-09-26 08:07:01,226 INFO L226 Difference]: Without dead ends: 1403 [2018-09-26 08:07:01,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-09-26 08:07:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-09-26 08:07:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-09-26 08:07:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-09-26 08:07:02,026 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-09-26 08:07:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:02,026 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-09-26 08:07:02,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-09-26 08:07:02,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:02,027 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:02,027 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:02,027 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:02,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-09-26 08:07:02,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:02,035 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:02,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:07:02,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:02,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:02,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:02,036 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-09-26 08:07:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:03,697 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-09-26 08:07:03,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:03,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:03,701 INFO L225 Difference]: With dead ends: 1490 [2018-09-26 08:07:03,701 INFO L226 Difference]: Without dead ends: 1482 [2018-09-26 08:07:03,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:07:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-09-26 08:07:04,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-09-26 08:07:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-26 08:07:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-09-26 08:07:04,614 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-09-26 08:07:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:04,614 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-09-26 08:07:04,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-09-26 08:07:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:04,615 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:04,616 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:04,616 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:04,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-09-26 08:07:04,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:04,625 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:04,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:07:04,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:04,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:04,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:04,626 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-09-26 08:07:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,150 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-09-26 08:07:06,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:07:06,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:06,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,152 INFO L225 Difference]: With dead ends: 1427 [2018-09-26 08:07:06,153 INFO L226 Difference]: Without dead ends: 1419 [2018-09-26 08:07:06,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:07:06,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-09-26 08:07:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-09-26 08:07:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-09-26 08:07:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-09-26 08:07:07,071 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-09-26 08:07:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:07,071 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-09-26 08:07:07,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-09-26 08:07:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:07,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:07,072 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:07,072 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:07,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:07,072 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-09-26 08:07:07,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:07,080 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:07,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:07:07,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:07,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:07,081 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-09-26 08:07:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:08,630 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-09-26 08:07:08,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:07:08,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:08,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:08,632 INFO L225 Difference]: With dead ends: 1306 [2018-09-26 08:07:08,632 INFO L226 Difference]: Without dead ends: 1298 [2018-09-26 08:07:08,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:07:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-09-26 08:07:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-09-26 08:07:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-26 08:07:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-09-26 08:07:09,606 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-09-26 08:07:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:09,606 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-09-26 08:07:09,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-09-26 08:07:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:09,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:09,607 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:09,608 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:09,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:09,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-09-26 08:07:09,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:09,615 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:09,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:09,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:09,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:09,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:09,616 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-09-26 08:07:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:10,984 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-09-26 08:07:10,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:10,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:10,986 INFO L225 Difference]: With dead ends: 1285 [2018-09-26 08:07:10,986 INFO L226 Difference]: Without dead ends: 1277 [2018-09-26 08:07:10,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-09-26 08:07:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-09-26 08:07:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-26 08:07:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-09-26 08:07:11,956 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-09-26 08:07:11,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:11,957 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-09-26 08:07:11,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-09-26 08:07:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:11,958 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:11,958 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:11,958 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:11,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:11,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-09-26 08:07:11,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:11,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:11,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:11,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:11,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:11,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:11,968 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-09-26 08:07:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:13,688 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-09-26 08:07:13,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:07:13,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:13,690 INFO L225 Difference]: With dead ends: 1518 [2018-09-26 08:07:13,690 INFO L226 Difference]: Without dead ends: 1510 [2018-09-26 08:07:13,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:07:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-09-26 08:07:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-09-26 08:07:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-09-26 08:07:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-09-26 08:07:14,755 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-09-26 08:07:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:14,755 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-09-26 08:07:14,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-09-26 08:07:14,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:14,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:14,756 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:14,756 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:14,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:14,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-09-26 08:07:14,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:14,763 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:14,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:14,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:14,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:14,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:14,764 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-09-26 08:07:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:16,434 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-09-26 08:07:16,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:07:16,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:16,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:16,436 INFO L225 Difference]: With dead ends: 1448 [2018-09-26 08:07:16,436 INFO L226 Difference]: Without dead ends: 1440 [2018-09-26 08:07:16,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-09-26 08:07:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-09-26 08:07:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-09-26 08:07:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-09-26 08:07:17,389 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-09-26 08:07:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:17,389 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-09-26 08:07:17,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-09-26 08:07:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:17,390 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:17,390 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:17,390 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:17,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:17,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-09-26 08:07:17,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:17,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:17,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:17,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:17,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:17,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:17,399 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-09-26 08:07:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:18,869 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-09-26 08:07:18,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:18,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:07:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:18,870 INFO L225 Difference]: With dead ends: 1254 [2018-09-26 08:07:18,870 INFO L226 Difference]: Without dead ends: 1246 [2018-09-26 08:07:18,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-09-26 08:07:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-09-26 08:07:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-26 08:07:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-09-26 08:07:19,795 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-09-26 08:07:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:19,796 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-09-26 08:07:19,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-09-26 08:07:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:19,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:19,797 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:19,797 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:19,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-09-26 08:07:19,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:19,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:19,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:19,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:19,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:19,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:19,806 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 9 states. [2018-09-26 08:07:21,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:21,186 INFO L93 Difference]: Finished difference Result 1152 states and 2509 transitions. [2018-09-26 08:07:21,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:21,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:07:21,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:21,188 INFO L225 Difference]: With dead ends: 1152 [2018-09-26 08:07:21,188 INFO L226 Difference]: Without dead ends: 1144 [2018-09-26 08:07:21,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-09-26 08:07:22,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 970. [2018-09-26 08:07:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-09-26 08:07:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-09-26 08:07:22,188 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-09-26 08:07:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:22,188 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-09-26 08:07:22,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-09-26 08:07:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:22,189 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:22,189 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:22,189 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:22,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:22,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-09-26 08:07:22,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:22,198 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:22,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:22,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:22,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:22,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:22,199 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-09-26 08:07:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:23,616 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-09-26 08:07:23,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:07:23,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:07:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:23,618 INFO L225 Difference]: With dead ends: 1180 [2018-09-26 08:07:23,619 INFO L226 Difference]: Without dead ends: 1172 [2018-09-26 08:07:23,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:23,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-09-26 08:07:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-09-26 08:07:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-09-26 08:07:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-09-26 08:07:24,630 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-09-26 08:07:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:24,630 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-09-26 08:07:24,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-09-26 08:07:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:24,631 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:24,631 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:24,631 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:24,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-09-26 08:07:24,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:24,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:24,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:24,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:24,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:24,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:24,641 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-09-26 08:07:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:26,070 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-09-26 08:07:26,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:26,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:07:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:26,072 INFO L225 Difference]: With dead ends: 1233 [2018-09-26 08:07:26,072 INFO L226 Difference]: Without dead ends: 1225 [2018-09-26 08:07:26,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:07:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-09-26 08:07:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-09-26 08:07:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-09-26 08:07:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-09-26 08:07:27,104 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-09-26 08:07:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:27,104 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-09-26 08:07:27,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-09-26 08:07:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:27,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:27,105 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:27,105 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:27,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:27,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-09-26 08:07:27,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:27,113 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:27,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-26 08:07:27,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:27,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:27,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:27,113 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-09-26 08:07:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:28,881 INFO L93 Difference]: Finished difference Result 1465 states and 3226 transitions. [2018-09-26 08:07:28,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:07:28,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:07:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:28,884 INFO L225 Difference]: With dead ends: 1465 [2018-09-26 08:07:28,884 INFO L226 Difference]: Without dead ends: 1457 [2018-09-26 08:07:28,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:07:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-09-26 08:07:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1013. [2018-09-26 08:07:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-09-26 08:07:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-09-26 08:07:29,997 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-09-26 08:07:29,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:29,998 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-09-26 08:07:29,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-09-26 08:07:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:29,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:29,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:29,999 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:29,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:29,999 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-09-26 08:07:29,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:30,007 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:30,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-26 08:07:30,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:30,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:30,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:30,008 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-09-26 08:07:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:32,052 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-09-26 08:07:32,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:07:32,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:07:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:32,054 INFO L225 Difference]: With dead ends: 1590 [2018-09-26 08:07:32,055 INFO L226 Difference]: Without dead ends: 1582 [2018-09-26 08:07:32,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:07:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-09-26 08:07:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-09-26 08:07:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-09-26 08:07:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-09-26 08:07:33,155 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-09-26 08:07:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:33,156 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-09-26 08:07:33,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-09-26 08:07:33,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:33,156 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:33,156 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:33,157 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:33,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:33,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-09-26 08:07:33,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:33,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:33,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:33,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:33,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:33,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:33,166 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 9 states. [2018-09-26 08:07:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:34,963 INFO L93 Difference]: Finished difference Result 1429 states and 3130 transitions. [2018-09-26 08:07:34,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:07:34,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:07:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:34,965 INFO L225 Difference]: With dead ends: 1429 [2018-09-26 08:07:34,965 INFO L226 Difference]: Without dead ends: 1421 [2018-09-26 08:07:34,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:07:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2018-09-26 08:07:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1031. [2018-09-26 08:07:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-09-26 08:07:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-09-26 08:07:36,274 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-09-26 08:07:36,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:36,275 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-09-26 08:07:36,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-09-26 08:07:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:36,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:36,276 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:36,276 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:36,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:36,276 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-09-26 08:07:36,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:36,283 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:36,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-26 08:07:36,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:36,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:36,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:36,284 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-09-26 08:07:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:38,072 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-09-26 08:07:38,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:07:38,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:07:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:38,074 INFO L225 Difference]: With dead ends: 1420 [2018-09-26 08:07:38,074 INFO L226 Difference]: Without dead ends: 1412 [2018-09-26 08:07:38,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:07:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-09-26 08:07:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-09-26 08:07:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-09-26 08:07:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-09-26 08:07:39,161 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-09-26 08:07:39,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:39,161 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-09-26 08:07:39,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-09-26 08:07:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:39,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:39,161 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:39,162 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:39,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-09-26 08:07:39,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:39,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:39,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:39,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:39,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:39,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:39,171 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 9 states. [2018-09-26 08:07:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:41,093 INFO L93 Difference]: Finished difference Result 1426 states and 3132 transitions. [2018-09-26 08:07:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:07:41,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:07:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:41,095 INFO L225 Difference]: With dead ends: 1426 [2018-09-26 08:07:41,095 INFO L226 Difference]: Without dead ends: 1418 [2018-09-26 08:07:41,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:07:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-09-26 08:07:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 956. [2018-09-26 08:07:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2018-09-26 08:07:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2159 transitions. [2018-09-26 08:07:42,253 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2159 transitions. Word has length 16 [2018-09-26 08:07:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:42,253 INFO L480 AbstractCegarLoop]: Abstraction has 956 states and 2159 transitions. [2018-09-26 08:07:42,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2159 transitions. [2018-09-26 08:07:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:42,254 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:42,254 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:42,255 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:42,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:42,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-09-26 08:07:42,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:42,267 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:42,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:42,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:42,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:42,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:42,268 INFO L87 Difference]: Start difference. First operand 956 states and 2159 transitions. Second operand 9 states. [2018-09-26 08:07:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:43,826 INFO L93 Difference]: Finished difference Result 1172 states and 2569 transitions. [2018-09-26 08:07:43,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:07:43,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:07:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:43,828 INFO L225 Difference]: With dead ends: 1172 [2018-09-26 08:07:43,828 INFO L226 Difference]: Without dead ends: 1164 [2018-09-26 08:07:43,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:07:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-09-26 08:07:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 856. [2018-09-26 08:07:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-09-26 08:07:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1928 transitions. [2018-09-26 08:07:44,773 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1928 transitions. Word has length 16 [2018-09-26 08:07:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:44,773 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1928 transitions. [2018-09-26 08:07:44,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1928 transitions. [2018-09-26 08:07:44,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:07:44,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:44,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:44,774 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:44,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:44,774 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-09-26 08:07:44,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:44,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-09-26 08:07:44,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:44,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:07:44,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:44,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:44,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:44,784 INFO L87 Difference]: Start difference. First operand 856 states and 1928 transitions. Second operand 8 states. [2018-09-26 08:07:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:46,408 INFO L93 Difference]: Finished difference Result 1295 states and 2858 transitions. [2018-09-26 08:07:46,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:46,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-09-26 08:07:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:46,410 INFO L225 Difference]: With dead ends: 1295 [2018-09-26 08:07:46,410 INFO L226 Difference]: Without dead ends: 1290 [2018-09-26 08:07:46,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:07:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-26 08:07:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1017. [2018-09-26 08:07:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2018-09-26 08:07:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 2270 transitions. [2018-09-26 08:07:47,709 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 2270 transitions. Word has length 17 [2018-09-26 08:07:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:47,710 INFO L480 AbstractCegarLoop]: Abstraction has 1017 states and 2270 transitions. [2018-09-26 08:07:47,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 2270 transitions. [2018-09-26 08:07:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:07:47,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:47,710 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:47,711 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:47,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:47,711 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-09-26 08:07:47,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:47,724 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:47,725 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:47,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:47,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:47,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:47,726 INFO L87 Difference]: Start difference. First operand 1017 states and 2270 transitions. Second operand 11 states. [2018-09-26 08:07:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:50,301 INFO L93 Difference]: Finished difference Result 1730 states and 3766 transitions. [2018-09-26 08:07:50,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:07:50,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-09-26 08:07:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:50,303 INFO L225 Difference]: With dead ends: 1730 [2018-09-26 08:07:50,303 INFO L226 Difference]: Without dead ends: 1722 [2018-09-26 08:07:50,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:07:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2018-09-26 08:07:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1463. [2018-09-26 08:07:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463 states. [2018-09-26 08:07:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 3272 transitions. [2018-09-26 08:07:52,160 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 3272 transitions. Word has length 17 [2018-09-26 08:07:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:52,160 INFO L480 AbstractCegarLoop]: Abstraction has 1463 states and 3272 transitions. [2018-09-26 08:07:52,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 3272 transitions. [2018-09-26 08:07:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:52,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:52,161 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:52,161 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:52,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:52,162 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-09-26 08:07:52,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:52,176 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:52,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:52,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:52,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:52,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:52,177 INFO L87 Difference]: Start difference. First operand 1463 states and 3272 transitions. Second operand 12 states. [2018-09-26 08:07:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:55,521 INFO L93 Difference]: Finished difference Result 2244 states and 4948 transitions. [2018-09-26 08:07:55,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:07:55,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:07:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:55,524 INFO L225 Difference]: With dead ends: 2244 [2018-09-26 08:07:55,524 INFO L226 Difference]: Without dead ends: 2236 [2018-09-26 08:07:55,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:07:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2018-09-26 08:07:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 1750. [2018-09-26 08:07:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-09-26 08:07:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3957 transitions. [2018-09-26 08:07:57,460 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 3957 transitions. Word has length 20 [2018-09-26 08:07:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:57,460 INFO L480 AbstractCegarLoop]: Abstraction has 1750 states and 3957 transitions. [2018-09-26 08:07:57,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3957 transitions. [2018-09-26 08:07:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:57,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:57,461 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:57,462 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:57,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash -408643838, now seen corresponding path program 1 times [2018-09-26 08:07:57,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:57,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:57,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:57,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:57,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:57,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:57,474 INFO L87 Difference]: Start difference. First operand 1750 states and 3957 transitions. Second operand 12 states. [2018-09-26 08:08:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:00,833 INFO L93 Difference]: Finished difference Result 2632 states and 5780 transitions. [2018-09-26 08:08:00,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:08:00,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:08:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:00,836 INFO L225 Difference]: With dead ends: 2632 [2018-09-26 08:08:00,837 INFO L226 Difference]: Without dead ends: 2624 [2018-09-26 08:08:00,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=314, Invalid=1578, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:08:00,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2018-09-26 08:08:02,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1762. [2018-09-26 08:08:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2018-09-26 08:08:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 3981 transitions. [2018-09-26 08:08:02,829 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 3981 transitions. Word has length 20 [2018-09-26 08:08:02,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:02,830 INFO L480 AbstractCegarLoop]: Abstraction has 1762 states and 3981 transitions. [2018-09-26 08:08:02,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 3981 transitions. [2018-09-26 08:08:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:02,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:02,831 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:02,831 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:02,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:02,832 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-09-26 08:08:02,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:02,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:02,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:02,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:02,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:02,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:02,847 INFO L87 Difference]: Start difference. First operand 1762 states and 3981 transitions. Second operand 12 states. [2018-09-26 08:08:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:06,812 INFO L93 Difference]: Finished difference Result 2682 states and 5922 transitions. [2018-09-26 08:08:06,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:08:06,813 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:08:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:06,815 INFO L225 Difference]: With dead ends: 2682 [2018-09-26 08:08:06,815 INFO L226 Difference]: Without dead ends: 2674 [2018-09-26 08:08:06,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=374, Invalid=2076, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:08:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2018-09-26 08:08:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 1808. [2018-09-26 08:08:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-09-26 08:08:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 4093 transitions. [2018-09-26 08:08:08,813 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 4093 transitions. Word has length 20 [2018-09-26 08:08:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:08,813 INFO L480 AbstractCegarLoop]: Abstraction has 1808 states and 4093 transitions. [2018-09-26 08:08:08,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 4093 transitions. [2018-09-26 08:08:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:08,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:08,815 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:08,815 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:08,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:08,815 INFO L82 PathProgramCache]: Analyzing trace with hash 822945893, now seen corresponding path program 1 times [2018-09-26 08:08:08,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:08,825 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:08,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:08,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:08,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:08,826 INFO L87 Difference]: Start difference. First operand 1808 states and 4093 transitions. Second operand 12 states. [2018-09-26 08:08:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:12,521 INFO L93 Difference]: Finished difference Result 2725 states and 5993 transitions. [2018-09-26 08:08:12,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:08:12,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:08:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:12,524 INFO L225 Difference]: With dead ends: 2725 [2018-09-26 08:08:12,524 INFO L226 Difference]: Without dead ends: 2717 [2018-09-26 08:08:12,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=344, Invalid=1548, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:08:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2018-09-26 08:08:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 1923. [2018-09-26 08:08:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2018-09-26 08:08:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 4343 transitions. [2018-09-26 08:08:14,695 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 4343 transitions. Word has length 20 [2018-09-26 08:08:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:14,696 INFO L480 AbstractCegarLoop]: Abstraction has 1923 states and 4343 transitions. [2018-09-26 08:08:14,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 4343 transitions. [2018-09-26 08:08:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:14,697 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:14,697 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:14,697 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:14,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:14,697 INFO L82 PathProgramCache]: Analyzing trace with hash 822946172, now seen corresponding path program 1 times [2018-09-26 08:08:14,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:14,707 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:14,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:14,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:14,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:14,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:14,708 INFO L87 Difference]: Start difference. First operand 1923 states and 4343 transitions. Second operand 12 states. [2018-09-26 08:08:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:19,236 INFO L93 Difference]: Finished difference Result 2981 states and 6573 transitions. [2018-09-26 08:08:19,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:08:19,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:08:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:19,240 INFO L225 Difference]: With dead ends: 2981 [2018-09-26 08:08:19,240 INFO L226 Difference]: Without dead ends: 2973 [2018-09-26 08:08:19,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=491, Invalid=2701, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:08:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2018-09-26 08:08:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1885. [2018-09-26 08:08:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885 states. [2018-09-26 08:08:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 4258 transitions. [2018-09-26 08:08:21,580 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 4258 transitions. Word has length 20 [2018-09-26 08:08:21,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:21,580 INFO L480 AbstractCegarLoop]: Abstraction has 1885 states and 4258 transitions. [2018-09-26 08:08:21,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:21,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 4258 transitions. [2018-09-26 08:08:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:21,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:21,581 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:21,581 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:21,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash 826825729, now seen corresponding path program 1 times [2018-09-26 08:08:21,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:21,591 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:21,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:21,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:21,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:21,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:21,592 INFO L87 Difference]: Start difference. First operand 1885 states and 4258 transitions. Second operand 12 states. [2018-09-26 08:08:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:25,700 INFO L93 Difference]: Finished difference Result 2756 states and 6082 transitions. [2018-09-26 08:08:25,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:08:25,700 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:08:25,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:25,703 INFO L225 Difference]: With dead ends: 2756 [2018-09-26 08:08:25,703 INFO L226 Difference]: Without dead ends: 2748 [2018-09-26 08:08:25,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=456, Invalid=2406, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:08:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2018-09-26 08:08:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2013. [2018-09-26 08:08:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2013 states. [2018-09-26 08:08:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 4552 transitions. [2018-09-26 08:08:28,134 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 4552 transitions. Word has length 20 [2018-09-26 08:08:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:28,134 INFO L480 AbstractCegarLoop]: Abstraction has 2013 states and 4552 transitions. [2018-09-26 08:08:28,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 4552 transitions. [2018-09-26 08:08:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:28,135 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:28,135 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:28,135 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:28,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:28,136 INFO L82 PathProgramCache]: Analyzing trace with hash 89905005, now seen corresponding path program 1 times [2018-09-26 08:08:28,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:08:28,146 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:28,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:08:28,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:08:28,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:08:28,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:08:28,147 INFO L87 Difference]: Start difference. First operand 2013 states and 4552 transitions. Second operand 10 states. [2018-09-26 08:08:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:31,241 INFO L93 Difference]: Finished difference Result 2560 states and 5727 transitions. [2018-09-26 08:08:31,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:08:31,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-09-26 08:08:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:31,244 INFO L225 Difference]: With dead ends: 2560 [2018-09-26 08:08:31,244 INFO L226 Difference]: Without dead ends: 2552 [2018-09-26 08:08:31,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:08:31,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-09-26 08:08:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2037. [2018-09-26 08:08:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2018-09-26 08:08:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 4589 transitions. [2018-09-26 08:08:33,682 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 4589 transitions. Word has length 20 [2018-09-26 08:08:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:33,683 INFO L480 AbstractCegarLoop]: Abstraction has 2037 states and 4589 transitions. [2018-09-26 08:08:33,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:08:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 4589 transitions. [2018-09-26 08:08:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:33,684 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:33,684 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:33,684 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:33,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:33,684 INFO L82 PathProgramCache]: Analyzing trace with hash 89905284, now seen corresponding path program 1 times [2018-09-26 08:08:33,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:08:33,698 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:33,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:08:33,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:08:33,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:08:33,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:08:33,699 INFO L87 Difference]: Start difference. First operand 2037 states and 4589 transitions. Second operand 10 states. [2018-09-26 08:08:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:37,508 INFO L93 Difference]: Finished difference Result 2954 states and 6607 transitions. [2018-09-26 08:08:37,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:08:37,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-09-26 08:08:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:37,512 INFO L225 Difference]: With dead ends: 2954 [2018-09-26 08:08:37,512 INFO L226 Difference]: Without dead ends: 2946 [2018-09-26 08:08:37,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:08:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2018-09-26 08:08:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2097. [2018-09-26 08:08:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2018-09-26 08:08:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 4733 transitions. [2018-09-26 08:08:40,099 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 4733 transitions. Word has length 20 [2018-09-26 08:08:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:40,100 INFO L480 AbstractCegarLoop]: Abstraction has 2097 states and 4733 transitions. [2018-09-26 08:08:40,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:08:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 4733 transitions. [2018-09-26 08:08:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:40,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:40,101 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:40,101 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:40,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash 93784841, now seen corresponding path program 1 times [2018-09-26 08:08:40,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:08:40,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:40,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:08:40,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:08:40,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:08:40,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:08:40,110 INFO L87 Difference]: Start difference. First operand 2097 states and 4733 transitions. Second operand 10 states. [2018-09-26 08:08:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:43,842 INFO L93 Difference]: Finished difference Result 2943 states and 6561 transitions. [2018-09-26 08:08:43,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:08:43,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-09-26 08:08:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:43,846 INFO L225 Difference]: With dead ends: 2943 [2018-09-26 08:08:43,846 INFO L226 Difference]: Without dead ends: 2935 [2018-09-26 08:08:43,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:08:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2018-09-26 08:08:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2113. [2018-09-26 08:08:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2018-09-26 08:08:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 4769 transitions. [2018-09-26 08:08:46,424 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 4769 transitions. Word has length 20 [2018-09-26 08:08:46,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:46,424 INFO L480 AbstractCegarLoop]: Abstraction has 2113 states and 4769 transitions. [2018-09-26 08:08:46,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:08:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 4769 transitions. [2018-09-26 08:08:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:46,425 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:46,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:46,425 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:46,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:46,426 INFO L82 PathProgramCache]: Analyzing trace with hash 183366378, now seen corresponding path program 1 times [2018-09-26 08:08:46,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:08:46,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:46,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:08:46,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:08:46,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:08:46,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:08:46,437 INFO L87 Difference]: Start difference. First operand 2113 states and 4769 transitions. Second operand 10 states. [2018-09-26 08:08:50,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:50,426 INFO L93 Difference]: Finished difference Result 3095 states and 6879 transitions. [2018-09-26 08:08:50,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:08:50,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-09-26 08:08:50,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:50,429 INFO L225 Difference]: With dead ends: 3095 [2018-09-26 08:08:50,430 INFO L226 Difference]: Without dead ends: 3087 [2018-09-26 08:08:50,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=260, Invalid=1222, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:08:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2018-09-26 08:08:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 2233. [2018-09-26 08:08:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2233 states. [2018-09-26 08:08:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 5055 transitions. [2018-09-26 08:08:53,100 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 5055 transitions. Word has length 20 [2018-09-26 08:08:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:53,100 INFO L480 AbstractCegarLoop]: Abstraction has 2233 states and 5055 transitions. [2018-09-26 08:08:53,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:08:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 5055 transitions. [2018-09-26 08:08:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:08:53,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:53,101 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:53,101 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:53,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:53,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1435011527, now seen corresponding path program 1 times [2018-09-26 08:08:53,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:53,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:53,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:53,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:53,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:53,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:53,114 INFO L87 Difference]: Start difference. First operand 2233 states and 5055 transitions. Second operand 11 states. [2018-09-26 08:08:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:57,874 INFO L93 Difference]: Finished difference Result 3570 states and 7977 transitions. [2018-09-26 08:08:57,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:08:57,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:08:57,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:57,878 INFO L225 Difference]: With dead ends: 3570 [2018-09-26 08:08:57,878 INFO L226 Difference]: Without dead ends: 3562 [2018-09-26 08:08:57,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=291, Invalid=1601, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:08:57,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2018-09-26 08:09:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 2257. [2018-09-26 08:09:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2018-09-26 08:09:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 5109 transitions. [2018-09-26 08:09:00,650 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 5109 transitions. Word has length 20 [2018-09-26 08:09:00,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:00,650 INFO L480 AbstractCegarLoop]: Abstraction has 2257 states and 5109 transitions. [2018-09-26 08:09:00,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:00,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 5109 transitions. [2018-09-26 08:09:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:09:00,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:00,651 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:00,652 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:00,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:00,652 INFO L82 PathProgramCache]: Analyzing trace with hash 777730375, now seen corresponding path program 1 times [2018-09-26 08:09:00,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:00,659 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:00,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:09:00,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:00,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:00,660 INFO L87 Difference]: Start difference. First operand 2257 states and 5109 transitions. Second operand 11 states. [2018-09-26 08:09:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:04,630 INFO L93 Difference]: Finished difference Result 2941 states and 6541 transitions. [2018-09-26 08:09:04,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:09:04,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:09:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:04,634 INFO L225 Difference]: With dead ends: 2941 [2018-09-26 08:09:04,634 INFO L226 Difference]: Without dead ends: 2933 [2018-09-26 08:09:04,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=258, Invalid=1224, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:09:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2018-09-26 08:09:07,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2372. [2018-09-26 08:09:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2372 states. [2018-09-26 08:09:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 5350 transitions. [2018-09-26 08:09:07,574 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 5350 transitions. Word has length 20 [2018-09-26 08:09:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:07,575 INFO L480 AbstractCegarLoop]: Abstraction has 2372 states and 5350 transitions. [2018-09-26 08:09:07,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 5350 transitions. [2018-09-26 08:09:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:07,576 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:07,577 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:07,577 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:07,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash 371911669, now seen corresponding path program 1 times [2018-09-26 08:09:07,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:07,587 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:07,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:09:07,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:07,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:07,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:07,588 INFO L87 Difference]: Start difference. First operand 2372 states and 5350 transitions. Second operand 11 states. [2018-09-26 08:09:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:12,276 INFO L93 Difference]: Finished difference Result 3102 states and 6851 transitions. [2018-09-26 08:09:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:09:12,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-09-26 08:09:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:12,279 INFO L225 Difference]: With dead ends: 3102 [2018-09-26 08:09:12,279 INFO L226 Difference]: Without dead ends: 3094 [2018-09-26 08:09:12,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=292, Invalid=1514, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:09:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2018-09-26 08:09:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 2548. [2018-09-26 08:09:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2018-09-26 08:09:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 5732 transitions. [2018-09-26 08:09:15,485 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 5732 transitions. Word has length 21 [2018-09-26 08:09:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:15,485 INFO L480 AbstractCegarLoop]: Abstraction has 2548 states and 5732 transitions. [2018-09-26 08:09:15,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 5732 transitions. [2018-09-26 08:09:15,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:15,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:15,488 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:15,488 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:15,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:15,488 INFO L82 PathProgramCache]: Analyzing trace with hash -377266403, now seen corresponding path program 1 times [2018-09-26 08:09:15,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:15,498 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:15,498 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:09:15,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:09:15,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:09:15,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:09:15,499 INFO L87 Difference]: Start difference. First operand 2548 states and 5732 transitions. Second operand 9 states. [2018-09-26 08:09:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:25,330 INFO L93 Difference]: Finished difference Result 9530 states and 21497 transitions. [2018-09-26 08:09:25,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:09:25,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-09-26 08:09:25,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:25,338 INFO L225 Difference]: With dead ends: 9530 [2018-09-26 08:09:25,339 INFO L226 Difference]: Without dead ends: 7258 [2018-09-26 08:09:25,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=240, Invalid=572, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:09:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7258 states. [2018-09-26 08:09:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7258 to 5099. [2018-09-26 08:09:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5099 states. [2018-09-26 08:09:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 11597 transitions. [2018-09-26 08:09:32,392 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 11597 transitions. Word has length 21 [2018-09-26 08:09:32,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:32,393 INFO L480 AbstractCegarLoop]: Abstraction has 5099 states and 11597 transitions. [2018-09-26 08:09:32,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:09:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 11597 transitions. [2018-09-26 08:09:32,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:09:32,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:32,395 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:32,395 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:32,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:32,395 INFO L82 PathProgramCache]: Analyzing trace with hash 504785992, now seen corresponding path program 1 times [2018-09-26 08:09:32,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:32,404 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:32,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:09:32,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:09:32,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:09:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:09:32,405 INFO L87 Difference]: Start difference. First operand 5099 states and 11597 transitions. Second operand 9 states. [2018-09-26 08:09:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:47,730 INFO L93 Difference]: Finished difference Result 13824 states and 31502 transitions. [2018-09-26 08:09:47,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:09:47,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-09-26 08:09:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:47,746 INFO L225 Difference]: With dead ends: 13824 [2018-09-26 08:09:47,746 INFO L226 Difference]: Without dead ends: 12174 [2018-09-26 08:09:47,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:09:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12174 states. [2018-09-26 08:09:57,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12174 to 7081. [2018-09-26 08:09:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7081 states. [2018-09-26 08:09:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7081 states to 7081 states and 15893 transitions. [2018-09-26 08:09:57,136 INFO L78 Accepts]: Start accepts. Automaton has 7081 states and 15893 transitions. Word has length 24 [2018-09-26 08:09:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:57,136 INFO L480 AbstractCegarLoop]: Abstraction has 7081 states and 15893 transitions. [2018-09-26 08:09:57,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:09:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 7081 states and 15893 transitions. [2018-09-26 08:09:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:09:57,139 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:57,139 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:57,139 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:57,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:57,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1269424552, now seen corresponding path program 1 times [2018-09-26 08:09:57,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:57,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:57,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:09:57,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:09:57,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:09:57,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:09:57,148 INFO L87 Difference]: Start difference. First operand 7081 states and 15893 transitions. Second operand 9 states. [2018-09-26 08:10:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:12,486 INFO L93 Difference]: Finished difference Result 14557 states and 32575 transitions. [2018-09-26 08:10:12,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:10:12,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-09-26 08:10:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:12,500 INFO L225 Difference]: With dead ends: 14557 [2018-09-26 08:10:12,500 INFO L226 Difference]: Without dead ends: 12252 [2018-09-26 08:10:12,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:10:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12252 states. [2018-09-26 08:10:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12252 to 7165. [2018-09-26 08:10:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7165 states. [2018-09-26 08:10:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7165 states to 7165 states and 16147 transitions. [2018-09-26 08:10:22,502 INFO L78 Accepts]: Start accepts. Automaton has 7165 states and 16147 transitions. Word has length 24 [2018-09-26 08:10:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:22,502 INFO L480 AbstractCegarLoop]: Abstraction has 7165 states and 16147 transitions. [2018-09-26 08:10:22,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:10:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 7165 states and 16147 transitions. [2018-09-26 08:10:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:10:22,507 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:22,507 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:22,507 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr9ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:22,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:22,507 INFO L82 PathProgramCache]: Analyzing trace with hash -277435291, now seen corresponding path program 1 times [2018-09-26 08:10:22,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:22,517 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:22,517 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:10:22,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:10:22,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:10:22,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:22,518 INFO L87 Difference]: Start difference. First operand 7165 states and 16147 transitions. Second operand 9 states. Received shutdown request... [2018-09-26 08:10:28,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:10:28,664 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:10:28,669 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:10:28,670 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:10:28 BoogieIcfgContainer [2018-09-26 08:10:28,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:10:28,671 INFO L168 Benchmark]: Toolchain (without parser) took 254717.51 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 1.9 GB in the end (delta: -440.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-09-26 08:10:28,672 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 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-09-26 08:10:28,673 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.71 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-09-26 08:10:28,673 INFO L168 Benchmark]: Boogie Preprocessor took 40.76 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-09-26 08:10:28,674 INFO L168 Benchmark]: RCFGBuilder took 440.02 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-09-26 08:10:28,674 INFO L168 Benchmark]: TraceAbstraction took 254177.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 1.9 GB in the end (delta: -451.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-09-26 08:10:28,677 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.15 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 52.71 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 40.76 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 440.02 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 254177.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 1.9 GB in the end (delta: -451.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (7165states) and FLOYD_HOARE automaton (currently 18 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (2877 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 254.0s OverallTime, 65 OverallIterations, 2 TraceHistogramMax, 163.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17146 SDtfs, 52518 SDslu, 60364 SDs, 0 SdLazy, 123889 SolverSat, 11436 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1884 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 1676 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11808 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7165occurred in iteration=64, 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: 88.8s AutomataMinimizationTime, 64 MinimizatonAttempts, 43578 StatesRemovedByMinimization, 64 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1003 NumberOfCodeBlocks, 1003 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 938 ConstructedInterpolants, 0 QuantifiedInterpolants, 50035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 35 PerfectInterpolantSequences, 39/124 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_out_Reals.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-10-28-690.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-10-28-690.csv Completed graceful shutdown