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_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:54,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:54,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:54,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:54,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:54,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:54,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:54,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:54,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:54,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:54,226 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:54,227 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:54,228 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:54,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:54,233 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:54,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:54,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:54,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:54,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:54,240 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:54,241 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:54,242 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:54,244 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:54,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:54,245 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:54,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:54,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:54,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:54,251 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:54,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:54,257 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:54,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:54,258 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:54,258 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:54,259 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:54,259 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:54,262 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:54,274 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:54,276 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:54,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:54,277 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:54,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:54,278 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:54,278 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:54,279 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:54,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:54,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:54,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:54,366 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:54,366 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:54,367 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-09-26 08:06:54,368 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-09-26 08:06:54,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:54,417 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:54,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:54,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:54,418 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:54,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:54" (1/1) ... [2018-09-26 08:06:54,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:54" (1/1) ... [2018-09-26 08:06:54,457 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:06:54,457 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:06:54,458 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:06:54,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:54,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:54,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:54,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:54,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:54" (1/1) ... [2018-09-26 08:06:54,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:54" (1/1) ... [2018-09-26 08:06:54,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:54" (1/1) ... [2018-09-26 08:06:54,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:54" (1/1) ... [2018-09-26 08:06:54,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:54" (1/1) ... [2018-09-26 08:06:54,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:54" (1/1) ... [2018-09-26 08:06:54,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:54" (1/1) ... [2018-09-26 08:06:54,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:54,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:54,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:54,485 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:54,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:54" (1/1) ... [2018-09-26 08:06:54,579 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 08:06:54,579 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 08:06:54,579 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 08:06:54,781 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:06:54,781 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:54 BoogieIcfgContainer [2018-09-26 08:06:54,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:54,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:54,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:54,786 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:54,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:54" (1/2) ... [2018-09-26 08:06:54,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151552a6 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:06:54, skipping insertion in model container [2018-09-26 08:06:54,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:54" (2/2) ... [2018-09-26 08:06:54,791 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-09-26 08:06:54,801 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:54,810 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-09-26 08:06:54,853 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:54,854 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:54,854 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:54,855 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:54,855 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:54,855 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:54,855 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:54,855 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:54,856 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-09-26 08:06:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:06:54,881 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:54,882 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:06:54,884 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:54,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-09-26 08:06:54,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:54,989 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:54,991 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:54,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:54,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:55,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:55,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:55,011 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-09-26 08:06:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:55,209 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-09-26 08:06:55,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:55,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:06:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:55,224 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:06:55,224 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:06:55,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:06:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-09-26 08:06:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:06:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-09-26 08:06:55,279 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-09-26 08:06:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:55,280 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-09-26 08:06:55,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-09-26 08:06:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:06:55,281 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:55,281 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:06:55,281 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:55,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:55,282 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-09-26 08:06:55,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:55,321 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:55,321 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:55,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:55,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:55,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:55,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:55,324 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-09-26 08:06:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:55,492 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-09-26 08:06:55,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:55,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:06:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:55,494 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:06:55,495 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:06:55,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:06:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-09-26 08:06:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:06:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-09-26 08:06:55,514 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-09-26 08:06:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:55,516 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-09-26 08:06:55,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-09-26 08:06:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:06:55,517 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:55,517 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 08:06:55,517 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:55,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:55,518 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-09-26 08:06:55,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:55,579 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:55,579 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:55,579 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:55,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:55,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:55,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:55,581 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-09-26 08:06:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:55,757 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-09-26 08:06:55,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:55,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 08:06:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:55,758 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:06:55,758 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:06:55,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:06:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-09-26 08:06:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:06:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-09-26 08:06:55,772 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-09-26 08:06:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:55,773 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-09-26 08:06:55,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-09-26 08:06:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:06:55,774 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:55,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 08:06:55,774 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:55,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-09-26 08:06:55,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:55,791 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:55,791 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:55,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:55,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:55,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:55,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:55,792 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-09-26 08:06:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:55,928 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-09-26 08:06:55,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:06:55,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 08:06:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:55,934 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:06:55,934 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:06:55,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:06:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-09-26 08:06:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:06:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-09-26 08:06:55,961 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-09-26 08:06:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:55,961 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-09-26 08:06:55,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-09-26 08:06:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:55,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:55,963 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:55,963 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:55,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:55,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-09-26 08:06:55,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:56,027 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:06:56,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:56,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:56,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:56,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:56,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:56,030 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 8 states. [2018-09-26 08:06:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:56,224 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2018-09-26 08:06:56,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:56,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:06:56,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:56,228 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:06:56,228 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:06:56,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:56,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:06:56,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2018-09-26 08:06:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:06:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 100 transitions. [2018-09-26 08:06:56,265 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 100 transitions. Word has length 8 [2018-09-26 08:06:56,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:56,265 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 100 transitions. [2018-09-26 08:06:56,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:56,266 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 100 transitions. [2018-09-26 08:06:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:56,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:56,267 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:56,267 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:56,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:56,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-09-26 08:06:56,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:56,302 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,302 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:56,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 08:06:56,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:56,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:56,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:56,304 INFO L87 Difference]: Start difference. First operand 59 states and 100 transitions. Second operand 8 states. [2018-09-26 08:06:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:56,455 INFO L93 Difference]: Finished difference Result 92 states and 146 transitions. [2018-09-26 08:06:56,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:56,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:06:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:56,462 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:06:56,463 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:06:56,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:06:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2018-09-26 08:06:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:06:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 125 transitions. [2018-09-26 08:06:56,503 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 125 transitions. Word has length 8 [2018-09-26 08:06:56,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:56,505 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 125 transitions. [2018-09-26 08:06:56,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 125 transitions. [2018-09-26 08:06:56,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:56,507 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:56,508 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:56,508 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:56,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:56,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-09-26 08:06:56,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:56,550 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:06:56,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:56,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:56,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:56,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:56,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:56,553 INFO L87 Difference]: Start difference. First operand 72 states and 125 transitions. Second operand 8 states. [2018-09-26 08:06:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:56,739 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions. [2018-09-26 08:06:56,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:56,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:06:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:56,742 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:06:56,744 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:06:56,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:06:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2018-09-26 08:06:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:06:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 135 transitions. [2018-09-26 08:06:56,783 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 135 transitions. Word has length 8 [2018-09-26 08:06:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:56,785 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 135 transitions. [2018-09-26 08:06:56,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 135 transitions. [2018-09-26 08:06:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:56,787 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:56,788 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:56,788 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:56,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:56,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-09-26 08:06:56,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:56,816 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:06:56,817 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:56,817 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:56,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:56,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:56,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:56,818 INFO L87 Difference]: Start difference. First operand 78 states and 135 transitions. Second operand 8 states. [2018-09-26 08:06:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:56,948 INFO L93 Difference]: Finished difference Result 109 states and 191 transitions. [2018-09-26 08:06:56,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:06:56,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:06:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:56,949 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:06:56,949 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:06:56,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:06:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2018-09-26 08:06:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:06:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 144 transitions. [2018-09-26 08:06:56,978 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 144 transitions. Word has length 8 [2018-09-26 08:06:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:56,979 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 144 transitions. [2018-09-26 08:06:56,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 144 transitions. [2018-09-26 08:06:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:56,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:56,980 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:56,981 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:56,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:56,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1965444251, now seen corresponding path program 1 times [2018-09-26 08:06:56,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:57,000 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:06:57,000 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:57,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:57,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:57,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:57,002 INFO L87 Difference]: Start difference. First operand 83 states and 144 transitions. Second operand 7 states. [2018-09-26 08:06:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:57,125 INFO L93 Difference]: Finished difference Result 103 states and 166 transitions. [2018-09-26 08:06:57,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:57,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:57,126 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:06:57,127 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:06:57,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:06:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2018-09-26 08:06:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:06:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 147 transitions. [2018-09-26 08:06:57,162 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 147 transitions. Word has length 8 [2018-09-26 08:06:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:57,163 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 147 transitions. [2018-09-26 08:06:57,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 147 transitions. [2018-09-26 08:06:57,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:57,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:57,168 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:57,169 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:57,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:57,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-09-26 08:06:57,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:57,199 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:06:57,200 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:57,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:57,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:57,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:57,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:57,201 INFO L87 Difference]: Start difference. First operand 85 states and 147 transitions. Second operand 8 states. [2018-09-26 08:06:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:57,360 INFO L93 Difference]: Finished difference Result 103 states and 167 transitions. [2018-09-26 08:06:57,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:57,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:06:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:57,362 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:06:57,362 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:06:57,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:57,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:06:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2018-09-26 08:06:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:06:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 151 transitions. [2018-09-26 08:06:57,391 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 151 transitions. Word has length 8 [2018-09-26 08:06:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:57,391 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 151 transitions. [2018-09-26 08:06:57,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:57,392 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 151 transitions. [2018-09-26 08:06:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:57,393 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:57,393 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:57,393 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:57,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:57,394 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-09-26 08:06:57,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:57,413 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:06:57,413 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:57,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:57,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:57,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:57,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:57,415 INFO L87 Difference]: Start difference. First operand 87 states and 151 transitions. Second operand 8 states. [2018-09-26 08:06:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:57,557 INFO L93 Difference]: Finished difference Result 128 states and 210 transitions. [2018-09-26 08:06:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:57,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:06:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:57,559 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:06:57,559 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:06:57,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:06:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100. [2018-09-26 08:06:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:06:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-09-26 08:06:57,597 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 8 [2018-09-26 08:06:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:57,597 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-09-26 08:06:57,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-09-26 08:06:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:57,599 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:57,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:57,599 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:57,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:57,600 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-09-26 08:06:57,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:57,614 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:06:57,614 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:57,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:57,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:57,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:57,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:57,616 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 7 states. [2018-09-26 08:06:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:57,751 INFO L93 Difference]: Finished difference Result 136 states and 229 transitions. [2018-09-26 08:06:57,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:57,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:57,752 INFO L225 Difference]: With dead ends: 136 [2018-09-26 08:06:57,753 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:06:57,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:57,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:06:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 102. [2018-09-26 08:06:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:06:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 178 transitions. [2018-09-26 08:06:57,792 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 178 transitions. Word has length 8 [2018-09-26 08:06:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:57,793 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 178 transitions. [2018-09-26 08:06:57,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 178 transitions. [2018-09-26 08:06:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:57,794 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:57,794 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:57,794 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:57,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-09-26 08:06:57,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:57,811 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:06:57,812 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:57,812 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:57,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:57,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:57,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:57,813 INFO L87 Difference]: Start difference. First operand 102 states and 178 transitions. Second operand 8 states. [2018-09-26 08:06:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:57,970 INFO L93 Difference]: Finished difference Result 150 states and 251 transitions. [2018-09-26 08:06:57,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:06:57,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:06:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:57,972 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:06:57,972 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:06:57,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:06:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121. [2018-09-26 08:06:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:06:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2018-09-26 08:06:58,021 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 213 transitions. Word has length 8 [2018-09-26 08:06:58,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:58,022 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 213 transitions. [2018-09-26 08:06:58,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions. [2018-09-26 08:06:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:58,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:58,031 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:58,032 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:58,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:58,032 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-09-26 08:06:58,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:58,049 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:58,049 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:58,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:58,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:58,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:58,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:58,051 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. Second operand 7 states. [2018-09-26 08:06:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:58,239 INFO L93 Difference]: Finished difference Result 178 states and 308 transitions. [2018-09-26 08:06:58,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:58,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:58,241 INFO L225 Difference]: With dead ends: 178 [2018-09-26 08:06:58,241 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:06:58,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:06:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 132. [2018-09-26 08:06:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 08:06:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 233 transitions. [2018-09-26 08:06:58,301 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 233 transitions. Word has length 8 [2018-09-26 08:06:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:58,301 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 233 transitions. [2018-09-26 08:06:58,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 233 transitions. [2018-09-26 08:06:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:58,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:58,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:58,303 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:58,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:58,303 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-09-26 08:06:58,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:58,318 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:06:58,319 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:58,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:58,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:58,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:58,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:58,320 INFO L87 Difference]: Start difference. First operand 132 states and 233 transitions. Second operand 7 states. [2018-09-26 08:06:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:58,515 INFO L93 Difference]: Finished difference Result 235 states and 413 transitions. [2018-09-26 08:06:58,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:58,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:06:58,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:58,518 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:06:58,518 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:06:58,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:06:58,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 179. [2018-09-26 08:06:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:06:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 320 transitions. [2018-09-26 08:06:58,605 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 320 transitions. Word has length 8 [2018-09-26 08:06:58,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:58,606 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 320 transitions. [2018-09-26 08:06:58,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 320 transitions. [2018-09-26 08:06:58,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:58,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:58,607 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:06:58,608 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:58,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:58,608 INFO L82 PathProgramCache]: Analyzing trace with hash -799219888, now seen corresponding path program 1 times [2018-09-26 08:06:58,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:58,637 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:06:58,638 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:58,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:58,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:58,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:58,639 INFO L87 Difference]: Start difference. First operand 179 states and 320 transitions. Second operand 8 states. [2018-09-26 08:06:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:58,887 INFO L93 Difference]: Finished difference Result 206 states and 368 transitions. [2018-09-26 08:06:58,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:58,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-26 08:06:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:58,889 INFO L225 Difference]: With dead ends: 206 [2018-09-26 08:06:58,889 INFO L226 Difference]: Without dead ends: 204 [2018-09-26 08:06:58,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-26 08:06:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2018-09-26 08:06:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 08:06:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 351 transitions. [2018-09-26 08:06:58,982 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 351 transitions. Word has length 9 [2018-09-26 08:06:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:58,983 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 351 transitions. [2018-09-26 08:06:58,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 351 transitions. [2018-09-26 08:06:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:58,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:58,984 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:58,985 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:58,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:58,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1170716006, now seen corresponding path program 1 times [2018-09-26 08:06:58,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,014 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:06:59,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:59,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:59,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:59,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:59,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:59,016 INFO L87 Difference]: Start difference. First operand 196 states and 351 transitions. Second operand 9 states. [2018-09-26 08:06:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:59,331 INFO L93 Difference]: Finished difference Result 266 states and 466 transitions. [2018-09-26 08:06:59,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:06:59,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-26 08:06:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:59,333 INFO L225 Difference]: With dead ends: 266 [2018-09-26 08:06:59,333 INFO L226 Difference]: Without dead ends: 264 [2018-09-26 08:06:59,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:06:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-09-26 08:06:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 222. [2018-09-26 08:06:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-26 08:06:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 402 transitions. [2018-09-26 08:06:59,436 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 402 transitions. Word has length 9 [2018-09-26 08:06:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,437 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 402 transitions. [2018-09-26 08:06:59,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 402 transitions. [2018-09-26 08:06:59,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:06:59,440 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:59,440 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:59,440 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:59,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:59,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-09-26 08:06:59,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,457 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:06:59,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:59,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:59,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:59,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:59,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:59,459 INFO L87 Difference]: Start difference. First operand 222 states and 402 transitions. Second operand 7 states. [2018-09-26 08:06:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:59,648 INFO L93 Difference]: Finished difference Result 264 states and 459 transitions. [2018-09-26 08:06:59,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:59,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 08:06:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:59,652 INFO L225 Difference]: With dead ends: 264 [2018-09-26 08:06:59,653 INFO L226 Difference]: Without dead ends: 262 [2018-09-26 08:06:59,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-26 08:06:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 231. [2018-09-26 08:06:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:06:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 420 transitions. [2018-09-26 08:06:59,748 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 420 transitions. Word has length 11 [2018-09-26 08:06:59,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,748 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 420 transitions. [2018-09-26 08:06:59,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:59,748 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 420 transitions. [2018-09-26 08:06:59,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:06:59,749 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:59,749 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:59,749 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:59,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:59,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000296, now seen corresponding path program 1 times [2018-09-26 08:06:59,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:59,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:59,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:59,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:59,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:59,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:59,770 INFO L87 Difference]: Start difference. First operand 231 states and 420 transitions. Second operand 9 states. [2018-09-26 08:06:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:59,955 INFO L93 Difference]: Finished difference Result 250 states and 439 transitions. [2018-09-26 08:06:59,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:59,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-09-26 08:06:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:59,959 INFO L225 Difference]: With dead ends: 250 [2018-09-26 08:06:59,959 INFO L226 Difference]: Without dead ends: 249 [2018-09-26 08:06:59,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-26 08:07:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2018-09-26 08:07:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:07:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 419 transitions. [2018-09-26 08:07:00,069 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 419 transitions. Word has length 11 [2018-09-26 08:07:00,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:00,070 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 419 transitions. [2018-09-26 08:07:00,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:00,070 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 419 transitions. [2018-09-26 08:07:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:00,071 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:00,071 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:00,071 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:00,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:00,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-09-26 08:07:00,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:00,099 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:00,099 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:00,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:00,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:00,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:00,100 INFO L87 Difference]: Start difference. First operand 231 states and 419 transitions. Second operand 9 states. [2018-09-26 08:07:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:00,387 INFO L93 Difference]: Finished difference Result 278 states and 490 transitions. [2018-09-26 08:07:00,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:00,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-09-26 08:07:00,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:00,389 INFO L225 Difference]: With dead ends: 278 [2018-09-26 08:07:00,389 INFO L226 Difference]: Without dead ends: 276 [2018-09-26 08:07:00,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:00,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-09-26 08:07:00,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 242. [2018-09-26 08:07:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-09-26 08:07:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 439 transitions. [2018-09-26 08:07:00,484 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 439 transitions. Word has length 11 [2018-09-26 08:07:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:00,485 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 439 transitions. [2018-09-26 08:07:00,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 439 transitions. [2018-09-26 08:07:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:00,486 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:00,486 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:00,486 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:00,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash 707062982, now seen corresponding path program 2 times [2018-09-26 08:07:00,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:00,500 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:00,500 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:00,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:07:00,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:00,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:00,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:00,502 INFO L87 Difference]: Start difference. First operand 242 states and 439 transitions. Second operand 7 states. [2018-09-26 08:07:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:00,692 INFO L93 Difference]: Finished difference Result 300 states and 527 transitions. [2018-09-26 08:07:00,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:00,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 08:07:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:00,694 INFO L225 Difference]: With dead ends: 300 [2018-09-26 08:07:00,694 INFO L226 Difference]: Without dead ends: 298 [2018-09-26 08:07:00,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-26 08:07:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 267. [2018-09-26 08:07:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:07:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 484 transitions. [2018-09-26 08:07:00,797 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 484 transitions. Word has length 11 [2018-09-26 08:07:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:00,797 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 484 transitions. [2018-09-26 08:07:00,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 484 transitions. [2018-09-26 08:07:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:00,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:00,798 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:00,799 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:00,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash 707063270, now seen corresponding path program 2 times [2018-09-26 08:07:00,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:00,820 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:00,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:00,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:00,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:00,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:00,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:00,822 INFO L87 Difference]: Start difference. First operand 267 states and 484 transitions. Second operand 9 states. [2018-09-26 08:07:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:01,074 INFO L93 Difference]: Finished difference Result 334 states and 589 transitions. [2018-09-26 08:07:01,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:07:01,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-09-26 08:07:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:01,079 INFO L225 Difference]: With dead ends: 334 [2018-09-26 08:07:01,079 INFO L226 Difference]: Without dead ends: 333 [2018-09-26 08:07:01,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:01,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-09-26 08:07:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 282. [2018-09-26 08:07:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-09-26 08:07:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 512 transitions. [2018-09-26 08:07:01,197 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 512 transitions. Word has length 11 [2018-09-26 08:07:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:01,199 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 512 transitions. [2018-09-26 08:07:01,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 512 transitions. [2018-09-26 08:07:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:01,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:01,201 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:01,201 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:01,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:01,201 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-09-26 08:07:01,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:01,223 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:01,224 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:01,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:07:01,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:01,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:01,225 INFO L87 Difference]: Start difference. First operand 282 states and 512 transitions. Second operand 8 states. [2018-09-26 08:07:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:01,526 INFO L93 Difference]: Finished difference Result 342 states and 604 transitions. [2018-09-26 08:07:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:01,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-26 08:07:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:01,529 INFO L225 Difference]: With dead ends: 342 [2018-09-26 08:07:01,529 INFO L226 Difference]: Without dead ends: 340 [2018-09-26 08:07:01,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:01,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-09-26 08:07:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2018-09-26 08:07:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-26 08:07:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 518 transitions. [2018-09-26 08:07:01,675 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 518 transitions. Word has length 11 [2018-09-26 08:07:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:01,675 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 518 transitions. [2018-09-26 08:07:01,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 518 transitions. [2018-09-26 08:07:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:01,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:01,676 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:01,677 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:01,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:01,677 INFO L82 PathProgramCache]: Analyzing trace with hash 285598401, now seen corresponding path program 1 times [2018-09-26 08:07:01,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:01,697 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:07:01,698 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:01,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:01,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:01,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:01,699 INFO L87 Difference]: Start difference. First operand 286 states and 518 transitions. Second operand 9 states. [2018-09-26 08:07:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:01,958 INFO L93 Difference]: Finished difference Result 300 states and 532 transitions. [2018-09-26 08:07:01,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:01,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-09-26 08:07:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:01,960 INFO L225 Difference]: With dead ends: 300 [2018-09-26 08:07:01,961 INFO L226 Difference]: Without dead ends: 298 [2018-09-26 08:07:01,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-26 08:07:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 251. [2018-09-26 08:07:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:07:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 450 transitions. [2018-09-26 08:07:02,064 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 450 transitions. Word has length 11 [2018-09-26 08:07:02,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:02,065 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 450 transitions. [2018-09-26 08:07:02,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 450 transitions. [2018-09-26 08:07:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:02,066 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:02,066 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:02,066 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:02,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:02,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-09-26 08:07:02,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:02,085 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:02,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 08:07:02,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:02,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:02,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:02,087 INFO L87 Difference]: Start difference. First operand 251 states and 450 transitions. Second operand 8 states. [2018-09-26 08:07:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:02,303 INFO L93 Difference]: Finished difference Result 286 states and 493 transitions. [2018-09-26 08:07:02,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:02,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-26 08:07:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:02,306 INFO L225 Difference]: With dead ends: 286 [2018-09-26 08:07:02,307 INFO L226 Difference]: Without dead ends: 284 [2018-09-26 08:07:02,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:02,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-26 08:07:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 257. [2018-09-26 08:07:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 08:07:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 460 transitions. [2018-09-26 08:07:02,416 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 460 transitions. Word has length 11 [2018-09-26 08:07:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:02,416 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 460 transitions. [2018-09-26 08:07:02,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 460 transitions. [2018-09-26 08:07:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:02,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:02,417 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:02,418 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:02,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:02,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-09-26 08:07:02,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:02,433 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:02,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:02,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:07:02,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:02,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:02,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:02,441 INFO L87 Difference]: Start difference. First operand 257 states and 460 transitions. Second operand 7 states. [2018-09-26 08:07:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:02,655 INFO L93 Difference]: Finished difference Result 292 states and 503 transitions. [2018-09-26 08:07:02,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:07:02,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 08:07:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:02,658 INFO L225 Difference]: With dead ends: 292 [2018-09-26 08:07:02,658 INFO L226 Difference]: Without dead ends: 290 [2018-09-26 08:07:02,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-26 08:07:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 256. [2018-09-26 08:07:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-09-26 08:07:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 458 transitions. [2018-09-26 08:07:02,771 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 458 transitions. Word has length 11 [2018-09-26 08:07:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:02,771 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 458 transitions. [2018-09-26 08:07:02,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 458 transitions. [2018-09-26 08:07:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:02,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:02,772 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:02,773 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:02,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:02,773 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-09-26 08:07:02,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:02,787 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:02,787 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:02,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:07:02,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:02,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:02,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:02,789 INFO L87 Difference]: Start difference. First operand 256 states and 458 transitions. Second operand 7 states. [2018-09-26 08:07:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:03,041 INFO L93 Difference]: Finished difference Result 320 states and 559 transitions. [2018-09-26 08:07:03,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:03,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 08:07:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:03,043 INFO L225 Difference]: With dead ends: 320 [2018-09-26 08:07:03,044 INFO L226 Difference]: Without dead ends: 318 [2018-09-26 08:07:03,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-26 08:07:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 281. [2018-09-26 08:07:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 08:07:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 503 transitions. [2018-09-26 08:07:03,163 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 503 transitions. Word has length 11 [2018-09-26 08:07:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:03,164 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 503 transitions. [2018-09-26 08:07:03,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 503 transitions. [2018-09-26 08:07:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:03,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:03,165 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:03,165 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:03,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:03,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-09-26 08:07:03,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:03,181 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:03,181 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:03,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:07:03,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:03,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:03,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:03,183 INFO L87 Difference]: Start difference. First operand 281 states and 503 transitions. Second operand 7 states. [2018-09-26 08:07:03,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:03,434 INFO L93 Difference]: Finished difference Result 333 states and 581 transitions. [2018-09-26 08:07:03,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:03,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 08:07:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:03,437 INFO L225 Difference]: With dead ends: 333 [2018-09-26 08:07:03,437 INFO L226 Difference]: Without dead ends: 331 [2018-09-26 08:07:03,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-09-26 08:07:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 285. [2018-09-26 08:07:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-26 08:07:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 510 transitions. [2018-09-26 08:07:03,562 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 510 transitions. Word has length 11 [2018-09-26 08:07:03,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:03,562 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 510 transitions. [2018-09-26 08:07:03,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 510 transitions. [2018-09-26 08:07:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:03,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:03,564 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:03,564 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:03,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:03,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-09-26 08:07:03,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:03,582 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:03,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:03,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:07:03,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:03,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:03,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:03,584 INFO L87 Difference]: Start difference. First operand 285 states and 510 transitions. Second operand 7 states. [2018-09-26 08:07:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:03,852 INFO L93 Difference]: Finished difference Result 353 states and 620 transitions. [2018-09-26 08:07:03,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:03,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 08:07:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:03,855 INFO L225 Difference]: With dead ends: 353 [2018-09-26 08:07:03,855 INFO L226 Difference]: Without dead ends: 351 [2018-09-26 08:07:03,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-26 08:07:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 306. [2018-09-26 08:07:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-26 08:07:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 547 transitions. [2018-09-26 08:07:03,995 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 547 transitions. Word has length 11 [2018-09-26 08:07:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:03,996 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 547 transitions. [2018-09-26 08:07:03,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 547 transitions. [2018-09-26 08:07:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:03,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:03,997 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:03,997 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:03,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-09-26 08:07:03,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:04,012 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:04,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:04,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:07:04,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:04,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:04,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:04,014 INFO L87 Difference]: Start difference. First operand 306 states and 547 transitions. Second operand 7 states. [2018-09-26 08:07:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:04,258 INFO L93 Difference]: Finished difference Result 331 states and 575 transitions. [2018-09-26 08:07:04,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:04,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 08:07:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:04,260 INFO L225 Difference]: With dead ends: 331 [2018-09-26 08:07:04,260 INFO L226 Difference]: Without dead ends: 329 [2018-09-26 08:07:04,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-09-26 08:07:04,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 300. [2018-09-26 08:07:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-09-26 08:07:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 534 transitions. [2018-09-26 08:07:04,411 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 534 transitions. Word has length 11 [2018-09-26 08:07:04,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:04,412 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 534 transitions. [2018-09-26 08:07:04,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:04,412 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 534 transitions. [2018-09-26 08:07:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:04,413 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:04,413 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:04,413 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:04,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:04,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-09-26 08:07:04,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:04,428 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:04,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:04,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:07:04,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:04,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:04,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:04,430 INFO L87 Difference]: Start difference. First operand 300 states and 534 transitions. Second operand 7 states. [2018-09-26 08:07:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:04,694 INFO L93 Difference]: Finished difference Result 354 states and 618 transitions. [2018-09-26 08:07:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:07:04,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 08:07:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:04,697 INFO L225 Difference]: With dead ends: 354 [2018-09-26 08:07:04,697 INFO L226 Difference]: Without dead ends: 352 [2018-09-26 08:07:04,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-09-26 08:07:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 286. [2018-09-26 08:07:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-26 08:07:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 510 transitions. [2018-09-26 08:07:04,833 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 510 transitions. Word has length 11 [2018-09-26 08:07:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:04,833 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 510 transitions. [2018-09-26 08:07:04,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 510 transitions. [2018-09-26 08:07:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:07:04,834 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:04,834 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:04,834 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:04,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:04,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-09-26 08:07:04,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:04,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:04,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:07:04,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:04,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:04,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:04,849 INFO L87 Difference]: Start difference. First operand 286 states and 510 transitions. Second operand 7 states. [2018-09-26 08:07:05,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:05,084 INFO L93 Difference]: Finished difference Result 344 states and 601 transitions. [2018-09-26 08:07:05,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:05,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 08:07:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:05,087 INFO L225 Difference]: With dead ends: 344 [2018-09-26 08:07:05,087 INFO L226 Difference]: Without dead ends: 342 [2018-09-26 08:07:05,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-09-26 08:07:05,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 279. [2018-09-26 08:07:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-09-26 08:07:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 496 transitions. [2018-09-26 08:07:05,219 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 496 transitions. Word has length 11 [2018-09-26 08:07:05,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:05,219 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 496 transitions. [2018-09-26 08:07:05,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 496 transitions. [2018-09-26 08:07:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:07:05,220 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:05,220 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:05,221 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:05,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:05,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1894600283, now seen corresponding path program 1 times [2018-09-26 08:07:05,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:05,250 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:05,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:05,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:05,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:05,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:05,252 INFO L87 Difference]: Start difference. First operand 279 states and 496 transitions. Second operand 7 states. [2018-09-26 08:07:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:05,515 INFO L93 Difference]: Finished difference Result 634 states and 1102 transitions. [2018-09-26 08:07:05,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:07:05,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-09-26 08:07:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:05,518 INFO L225 Difference]: With dead ends: 634 [2018-09-26 08:07:05,519 INFO L226 Difference]: Without dead ends: 356 [2018-09-26 08:07:05,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-09-26 08:07:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 339. [2018-09-26 08:07:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-26 08:07:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 589 transitions. [2018-09-26 08:07:05,685 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 589 transitions. Word has length 12 [2018-09-26 08:07:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:05,685 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 589 transitions. [2018-09-26 08:07:05,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 589 transitions. [2018-09-26 08:07:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:07:05,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:05,686 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:05,687 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:05,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:05,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1217022044, now seen corresponding path program 1 times [2018-09-26 08:07:05,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:05,716 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:05,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:05,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:05,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:05,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:05,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:05,718 INFO L87 Difference]: Start difference. First operand 339 states and 589 transitions. Second operand 9 states. [2018-09-26 08:07:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,028 INFO L93 Difference]: Finished difference Result 433 states and 739 transitions. [2018-09-26 08:07:06,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:07:06,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:07:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,031 INFO L225 Difference]: With dead ends: 433 [2018-09-26 08:07:06,031 INFO L226 Difference]: Without dead ends: 431 [2018-09-26 08:07:06,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:07:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-09-26 08:07:06,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 396. [2018-09-26 08:07:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-09-26 08:07:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 693 transitions. [2018-09-26 08:07:06,205 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 693 transitions. Word has length 12 [2018-09-26 08:07:06,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:06,205 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 693 transitions. [2018-09-26 08:07:06,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 693 transitions. [2018-09-26 08:07:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:07:06,206 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:06,206 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:06,207 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:06,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:06,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1730496441, now seen corresponding path program 2 times [2018-09-26 08:07:06,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:06,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:06,229 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:06,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:06,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:06,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:06,229 INFO L87 Difference]: Start difference. First operand 396 states and 693 transitions. Second operand 7 states. [2018-09-26 08:07:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,597 INFO L93 Difference]: Finished difference Result 897 states and 1547 transitions. [2018-09-26 08:07:06,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:07:06,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-09-26 08:07:06,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,600 INFO L225 Difference]: With dead ends: 897 [2018-09-26 08:07:06,600 INFO L226 Difference]: Without dead ends: 502 [2018-09-26 08:07:06,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-09-26 08:07:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 435. [2018-09-26 08:07:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-09-26 08:07:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 751 transitions. [2018-09-26 08:07:06,823 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 751 transitions. Word has length 12 [2018-09-26 08:07:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:06,823 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 751 transitions. [2018-09-26 08:07:06,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 751 transitions. [2018-09-26 08:07:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:07:06,824 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:06,824 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:06,824 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:06,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-09-26 08:07:06,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:06,851 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:06,851 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:06,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:06,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:06,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:06,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:06,852 INFO L87 Difference]: Start difference. First operand 435 states and 751 transitions. Second operand 9 states. [2018-09-26 08:07:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:07,180 INFO L93 Difference]: Finished difference Result 481 states and 818 transitions. [2018-09-26 08:07:07,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:07,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:07:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:07,183 INFO L225 Difference]: With dead ends: 481 [2018-09-26 08:07:07,183 INFO L226 Difference]: Without dead ends: 479 [2018-09-26 08:07:07,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-09-26 08:07:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 444. [2018-09-26 08:07:07,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-09-26 08:07:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 764 transitions. [2018-09-26 08:07:07,420 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 764 transitions. Word has length 12 [2018-09-26 08:07:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:07,420 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 764 transitions. [2018-09-26 08:07:07,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 764 transitions. [2018-09-26 08:07:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:07:07,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:07,421 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:07,422 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:07,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-09-26 08:07:07,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:07,442 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:07:07,442 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:07,442 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:07,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:07,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:07,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:07,445 INFO L87 Difference]: Start difference. First operand 444 states and 764 transitions. Second operand 9 states. [2018-09-26 08:07:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:07,918 INFO L93 Difference]: Finished difference Result 515 states and 880 transitions. [2018-09-26 08:07:07,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:07,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 08:07:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:07,921 INFO L225 Difference]: With dead ends: 515 [2018-09-26 08:07:07,921 INFO L226 Difference]: Without dead ends: 513 [2018-09-26 08:07:07,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:07:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-09-26 08:07:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 468. [2018-09-26 08:07:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-09-26 08:07:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 808 transitions. [2018-09-26 08:07:08,162 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 808 transitions. Word has length 12 [2018-09-26 08:07:08,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:08,162 INFO L480 AbstractCegarLoop]: Abstraction has 468 states and 808 transitions. [2018-09-26 08:07:08,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:08,162 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 808 transitions. [2018-09-26 08:07:08,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:07:08,163 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:08,163 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:08,163 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:08,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:08,164 INFO L82 PathProgramCache]: Analyzing trace with hash -317442274, now seen corresponding path program 1 times [2018-09-26 08:07:08,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:08,187 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:07:08,187 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:08,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:08,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:08,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:08,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:08,189 INFO L87 Difference]: Start difference. First operand 468 states and 808 transitions. Second operand 9 states. [2018-09-26 08:07:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:08,666 INFO L93 Difference]: Finished difference Result 550 states and 930 transitions. [2018-09-26 08:07:08,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:07:08,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 08:07:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:08,669 INFO L225 Difference]: With dead ends: 550 [2018-09-26 08:07:08,670 INFO L226 Difference]: Without dead ends: 548 [2018-09-26 08:07:08,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:07:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-09-26 08:07:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 483. [2018-09-26 08:07:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-09-26 08:07:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 836 transitions. [2018-09-26 08:07:08,935 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 836 transitions. Word has length 13 [2018-09-26 08:07:08,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:08,935 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 836 transitions. [2018-09-26 08:07:08,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 836 transitions. [2018-09-26 08:07:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:07:08,939 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:08,939 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:08,939 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:08,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:08,940 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-09-26 08:07:08,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:08,953 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:08,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:08,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:08,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:08,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:08,954 INFO L87 Difference]: Start difference. First operand 483 states and 836 transitions. Second operand 8 states. [2018-09-26 08:07:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:09,314 INFO L93 Difference]: Finished difference Result 528 states and 903 transitions. [2018-09-26 08:07:09,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:09,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:07:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:09,317 INFO L225 Difference]: With dead ends: 528 [2018-09-26 08:07:09,318 INFO L226 Difference]: Without dead ends: 526 [2018-09-26 08:07:09,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-09-26 08:07:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 487. [2018-09-26 08:07:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-26 08:07:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 842 transitions. [2018-09-26 08:07:09,577 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 842 transitions. Word has length 14 [2018-09-26 08:07:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:09,577 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 842 transitions. [2018-09-26 08:07:09,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 842 transitions. [2018-09-26 08:07:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:07:09,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:09,579 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:09,579 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:09,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-09-26 08:07:09,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:09,595 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:07:09,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:09,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:09,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:09,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:09,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:09,596 INFO L87 Difference]: Start difference. First operand 487 states and 842 transitions. Second operand 8 states. [2018-09-26 08:07:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:10,015 INFO L93 Difference]: Finished difference Result 562 states and 960 transitions. [2018-09-26 08:07:10,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:10,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:07:10,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:10,018 INFO L225 Difference]: With dead ends: 562 [2018-09-26 08:07:10,019 INFO L226 Difference]: Without dead ends: 560 [2018-09-26 08:07:10,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:07:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-09-26 08:07:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 487. [2018-09-26 08:07:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-26 08:07:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 842 transitions. [2018-09-26 08:07:10,287 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 842 transitions. Word has length 14 [2018-09-26 08:07:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:10,288 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 842 transitions. [2018-09-26 08:07:10,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 842 transitions. [2018-09-26 08:07:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:07:10,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:10,289 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:10,289 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:10,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:10,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1602335980, now seen corresponding path program 3 times [2018-09-26 08:07:10,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:10,301 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:10,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:10,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:10,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:10,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:10,302 INFO L87 Difference]: Start difference. First operand 487 states and 842 transitions. Second operand 8 states. [2018-09-26 08:07:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:10,696 INFO L93 Difference]: Finished difference Result 554 states and 945 transitions. [2018-09-26 08:07:10,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:10,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:07:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:10,700 INFO L225 Difference]: With dead ends: 554 [2018-09-26 08:07:10,700 INFO L226 Difference]: Without dead ends: 552 [2018-09-26 08:07:10,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-09-26 08:07:10,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 481. [2018-09-26 08:07:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-09-26 08:07:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 832 transitions. [2018-09-26 08:07:10,959 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 832 transitions. Word has length 14 [2018-09-26 08:07:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:10,959 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 832 transitions. [2018-09-26 08:07:10,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 832 transitions. [2018-09-26 08:07:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:07:10,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:10,960 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:10,960 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:10,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash -245567750, now seen corresponding path program 4 times [2018-09-26 08:07:10,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:10,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:10,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:10,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:10,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:10,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:10,977 INFO L87 Difference]: Start difference. First operand 481 states and 832 transitions. Second operand 8 states. [2018-09-26 08:07:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:11,362 INFO L93 Difference]: Finished difference Result 547 states and 937 transitions. [2018-09-26 08:07:11,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:11,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:07:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:11,365 INFO L225 Difference]: With dead ends: 547 [2018-09-26 08:07:11,365 INFO L226 Difference]: Without dead ends: 545 [2018-09-26 08:07:11,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:07:11,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-09-26 08:07:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 488. [2018-09-26 08:07:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-09-26 08:07:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 844 transitions. [2018-09-26 08:07:11,599 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 844 transitions. Word has length 14 [2018-09-26 08:07:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:11,600 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 844 transitions. [2018-09-26 08:07:11,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 844 transitions. [2018-09-26 08:07:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:07:11,601 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:11,601 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:11,601 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:11,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:11,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-09-26 08:07:11,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:11,622 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:11,622 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:11,623 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:11,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:11,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:11,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:11,624 INFO L87 Difference]: Start difference. First operand 488 states and 844 transitions. Second operand 9 states. [2018-09-26 08:07:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:11,978 INFO L93 Difference]: Finished difference Result 545 states and 922 transitions. [2018-09-26 08:07:11,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:11,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-09-26 08:07:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:11,981 INFO L225 Difference]: With dead ends: 545 [2018-09-26 08:07:11,981 INFO L226 Difference]: Without dead ends: 543 [2018-09-26 08:07:11,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-09-26 08:07:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 473. [2018-09-26 08:07:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-09-26 08:07:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 820 transitions. [2018-09-26 08:07:12,176 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 820 transitions. Word has length 14 [2018-09-26 08:07:12,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:12,176 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 820 transitions. [2018-09-26 08:07:12,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 820 transitions. [2018-09-26 08:07:12,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:07:12,178 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:12,178 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:12,178 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:12,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:12,178 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-09-26 08:07:12,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:12,191 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:12,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:12,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:12,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:12,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:12,192 INFO L87 Difference]: Start difference. First operand 473 states and 820 transitions. Second operand 8 states. [2018-09-26 08:07:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:12,553 INFO L93 Difference]: Finished difference Result 535 states and 908 transitions. [2018-09-26 08:07:12,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:12,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:07:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:12,556 INFO L225 Difference]: With dead ends: 535 [2018-09-26 08:07:12,556 INFO L226 Difference]: Without dead ends: 533 [2018-09-26 08:07:12,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:12,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-09-26 08:07:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 469. [2018-09-26 08:07:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-09-26 08:07:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 814 transitions. [2018-09-26 08:07:12,794 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 814 transitions. Word has length 14 [2018-09-26 08:07:12,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:12,794 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 814 transitions. [2018-09-26 08:07:12,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 814 transitions. [2018-09-26 08:07:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:12,795 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:12,795 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:12,796 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:12,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:12,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1810259450, now seen corresponding path program 1 times [2018-09-26 08:07:12,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:12,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:12,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:12,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:12,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:12,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:12,813 INFO L87 Difference]: Start difference. First operand 469 states and 814 transitions. Second operand 9 states. [2018-09-26 08:07:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:13,399 INFO L93 Difference]: Finished difference Result 1268 states and 2153 transitions. [2018-09-26 08:07:13,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:13,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-09-26 08:07:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:13,403 INFO L225 Difference]: With dead ends: 1268 [2018-09-26 08:07:13,403 INFO L226 Difference]: Without dead ends: 764 [2018-09-26 08:07:13,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-09-26 08:07:13,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 651. [2018-09-26 08:07:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-09-26 08:07:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1121 transitions. [2018-09-26 08:07:13,741 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1121 transitions. Word has length 15 [2018-09-26 08:07:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:13,741 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 1121 transitions. [2018-09-26 08:07:13,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1121 transitions. [2018-09-26 08:07:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:13,742 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:13,743 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:13,743 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:13,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash 765271427, now seen corresponding path program 1 times [2018-09-26 08:07:13,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:13,758 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:13,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:13,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:13,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:13,759 INFO L87 Difference]: Start difference. First operand 651 states and 1121 transitions. Second operand 8 states. [2018-09-26 08:07:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:14,380 INFO L93 Difference]: Finished difference Result 1561 states and 2653 transitions. [2018-09-26 08:07:14,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:14,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-09-26 08:07:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:14,385 INFO L225 Difference]: With dead ends: 1561 [2018-09-26 08:07:14,385 INFO L226 Difference]: Without dead ends: 911 [2018-09-26 08:07:14,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-09-26 08:07:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 651. [2018-09-26 08:07:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-09-26 08:07:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1114 transitions. [2018-09-26 08:07:14,764 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1114 transitions. Word has length 15 [2018-09-26 08:07:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:14,765 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 1114 transitions. [2018-09-26 08:07:14,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1114 transitions. [2018-09-26 08:07:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:14,766 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:14,766 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:14,767 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:14,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1161913671, now seen corresponding path program 1 times [2018-09-26 08:07:14,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:14,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:14,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:14,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:14,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:14,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:14,790 INFO L87 Difference]: Start difference. First operand 651 states and 1114 transitions. Second operand 10 states. [2018-09-26 08:07:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:15,298 INFO L93 Difference]: Finished difference Result 756 states and 1259 transitions. [2018-09-26 08:07:15,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:07:15,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:07:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:15,302 INFO L225 Difference]: With dead ends: 756 [2018-09-26 08:07:15,302 INFO L226 Difference]: Without dead ends: 754 [2018-09-26 08:07:15,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:07:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-09-26 08:07:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 687. [2018-09-26 08:07:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-09-26 08:07:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1172 transitions. [2018-09-26 08:07:15,580 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1172 transitions. Word has length 15 [2018-09-26 08:07:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:15,580 INFO L480 AbstractCegarLoop]: Abstraction has 687 states and 1172 transitions. [2018-09-26 08:07:15,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1172 transitions. [2018-09-26 08:07:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:15,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:15,581 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:15,582 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:15,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:15,582 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-09-26 08:07:15,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:15,599 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:15,599 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:15,599 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:15,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:15,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:15,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:15,600 INFO L87 Difference]: Start difference. First operand 687 states and 1172 transitions. Second operand 10 states. [2018-09-26 08:07:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:16,187 INFO L93 Difference]: Finished difference Result 826 states and 1381 transitions. [2018-09-26 08:07:16,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:07:16,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:07:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:16,191 INFO L225 Difference]: With dead ends: 826 [2018-09-26 08:07:16,192 INFO L226 Difference]: Without dead ends: 824 [2018-09-26 08:07:16,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2018-09-26 08:07:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 720. [2018-09-26 08:07:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-09-26 08:07:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1226 transitions. [2018-09-26 08:07:16,619 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1226 transitions. Word has length 15 [2018-09-26 08:07:16,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:16,620 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1226 transitions. [2018-09-26 08:07:16,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1226 transitions. [2018-09-26 08:07:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:16,621 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:16,621 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:16,622 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:16,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash -176946971, now seen corresponding path program 1 times [2018-09-26 08:07:16,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:16,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:16,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:16,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:16,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:16,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:16,656 INFO L87 Difference]: Start difference. First operand 720 states and 1226 transitions. Second operand 10 states. [2018-09-26 08:07:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:17,276 INFO L93 Difference]: Finished difference Result 843 states and 1413 transitions. [2018-09-26 08:07:17,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:07:17,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:07:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:17,281 INFO L225 Difference]: With dead ends: 843 [2018-09-26 08:07:17,281 INFO L226 Difference]: Without dead ends: 841 [2018-09-26 08:07:17,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-09-26 08:07:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 770. [2018-09-26 08:07:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-09-26 08:07:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1300 transitions. [2018-09-26 08:07:17,727 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1300 transitions. Word has length 15 [2018-09-26 08:07:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:17,727 INFO L480 AbstractCegarLoop]: Abstraction has 770 states and 1300 transitions. [2018-09-26 08:07:17,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1300 transitions. [2018-09-26 08:07:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:17,728 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:17,728 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:17,729 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:17,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:17,729 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-09-26 08:07:17,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:17,746 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:17,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:17,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:17,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:17,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:17,747 INFO L87 Difference]: Start difference. First operand 770 states and 1300 transitions. Second operand 10 states. [2018-09-26 08:07:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:18,375 INFO L93 Difference]: Finished difference Result 960 states and 1623 transitions. [2018-09-26 08:07:18,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:18,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:07:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:18,380 INFO L225 Difference]: With dead ends: 960 [2018-09-26 08:07:18,380 INFO L226 Difference]: Without dead ends: 958 [2018-09-26 08:07:18,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2018-09-26 08:07:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 837. [2018-09-26 08:07:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-26 08:07:18,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1422 transitions. [2018-09-26 08:07:18,767 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1422 transitions. Word has length 15 [2018-09-26 08:07:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:18,768 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1422 transitions. [2018-09-26 08:07:18,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1422 transitions. [2018-09-26 08:07:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:18,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:18,769 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:18,769 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:18,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:18,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1949120374, now seen corresponding path program 2 times [2018-09-26 08:07:18,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:18,782 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:18,782 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:18,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:18,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:18,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:18,783 INFO L87 Difference]: Start difference. First operand 837 states and 1422 transitions. Second operand 10 states. [2018-09-26 08:07:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:19,604 INFO L93 Difference]: Finished difference Result 1027 states and 1720 transitions. [2018-09-26 08:07:19,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:19,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:07:19,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:19,611 INFO L225 Difference]: With dead ends: 1027 [2018-09-26 08:07:19,612 INFO L226 Difference]: Without dead ends: 1025 [2018-09-26 08:07:19,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:07:19,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-09-26 08:07:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 849. [2018-09-26 08:07:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-09-26 08:07:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1445 transitions. [2018-09-26 08:07:20,111 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1445 transitions. Word has length 15 [2018-09-26 08:07:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:20,112 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 1445 transitions. [2018-09-26 08:07:20,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1445 transitions. [2018-09-26 08:07:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:20,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:20,113 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:07:20,114 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:20,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:20,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-09-26 08:07:20,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:20,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:20,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:20,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:20,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:20,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:20,130 INFO L87 Difference]: Start difference. First operand 849 states and 1445 transitions. Second operand 10 states. [2018-09-26 08:07:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:20,918 INFO L93 Difference]: Finished difference Result 1032 states and 1733 transitions. [2018-09-26 08:07:20,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:07:20,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:07:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:20,924 INFO L225 Difference]: With dead ends: 1032 [2018-09-26 08:07:20,924 INFO L226 Difference]: Without dead ends: 1030 [2018-09-26 08:07:20,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:07:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-09-26 08:07:21,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 869. [2018-09-26 08:07:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-09-26 08:07:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1477 transitions. [2018-09-26 08:07:21,239 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1477 transitions. Word has length 15 [2018-09-26 08:07:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:21,239 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1477 transitions. [2018-09-26 08:07:21,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1477 transitions. [2018-09-26 08:07:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:21,241 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:21,241 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:21,241 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:21,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:21,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1652283980, now seen corresponding path program 1 times [2018-09-26 08:07:21,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:21,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:21,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:21,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:21,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:21,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:21,257 INFO L87 Difference]: Start difference. First operand 869 states and 1477 transitions. Second operand 10 states. [2018-09-26 08:07:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:21,711 INFO L93 Difference]: Finished difference Result 945 states and 1593 transitions. [2018-09-26 08:07:21,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:07:21,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:07:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:21,716 INFO L225 Difference]: With dead ends: 945 [2018-09-26 08:07:21,716 INFO L226 Difference]: Without dead ends: 943 [2018-09-26 08:07:21,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:07:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-09-26 08:07:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 869. [2018-09-26 08:07:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-09-26 08:07:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1474 transitions. [2018-09-26 08:07:22,035 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1474 transitions. Word has length 15 [2018-09-26 08:07:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:22,035 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1474 transitions. [2018-09-26 08:07:22,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1474 transitions. [2018-09-26 08:07:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:22,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:22,036 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:22,036 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:22,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:22,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1643695811, now seen corresponding path program 1 times [2018-09-26 08:07:22,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:22,047 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:22,047 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:22,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:22,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:22,048 INFO L87 Difference]: Start difference. First operand 869 states and 1474 transitions. Second operand 10 states. [2018-09-26 08:07:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:22,505 INFO L93 Difference]: Finished difference Result 978 states and 1648 transitions. [2018-09-26 08:07:22,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:07:22,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:07:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:22,510 INFO L225 Difference]: With dead ends: 978 [2018-09-26 08:07:22,510 INFO L226 Difference]: Without dead ends: 976 [2018-09-26 08:07:22,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:07:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-09-26 08:07:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 871. [2018-09-26 08:07:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-09-26 08:07:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1477 transitions. [2018-09-26 08:07:22,834 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1477 transitions. Word has length 15 [2018-09-26 08:07:22,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:22,834 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1477 transitions. [2018-09-26 08:07:22,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1477 transitions. [2018-09-26 08:07:22,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:22,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:22,835 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:22,836 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:22,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1603552790, now seen corresponding path program 1 times [2018-09-26 08:07:22,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:22,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:07:22,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:22,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:22,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:22,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:22,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:22,848 INFO L87 Difference]: Start difference. First operand 871 states and 1477 transitions. Second operand 10 states. [2018-09-26 08:07:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:23,452 INFO L93 Difference]: Finished difference Result 1018 states and 1716 transitions. [2018-09-26 08:07:23,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:07:23,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:07:23,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:23,457 INFO L225 Difference]: With dead ends: 1018 [2018-09-26 08:07:23,457 INFO L226 Difference]: Without dead ends: 1016 [2018-09-26 08:07:23,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-09-26 08:07:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 931. [2018-09-26 08:07:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-09-26 08:07:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1584 transitions. [2018-09-26 08:07:23,834 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1584 transitions. Word has length 15 [2018-09-26 08:07:23,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:23,834 INFO L480 AbstractCegarLoop]: Abstraction has 931 states and 1584 transitions. [2018-09-26 08:07:23,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1584 transitions. [2018-09-26 08:07:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:23,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:23,835 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:23,836 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:23,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash -38294824, now seen corresponding path program 2 times [2018-09-26 08:07:23,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:23,845 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:23,845 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:23,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:23,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:23,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:23,845 INFO L87 Difference]: Start difference. First operand 931 states and 1584 transitions. Second operand 10 states. [2018-09-26 08:07:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:24,367 INFO L93 Difference]: Finished difference Result 1157 states and 1937 transitions. [2018-09-26 08:07:24,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:24,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:07:24,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:24,371 INFO L225 Difference]: With dead ends: 1157 [2018-09-26 08:07:24,371 INFO L226 Difference]: Without dead ends: 1155 [2018-09-26 08:07:24,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-09-26 08:07:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 976. [2018-09-26 08:07:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-09-26 08:07:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1662 transitions. [2018-09-26 08:07:24,748 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1662 transitions. Word has length 15 [2018-09-26 08:07:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:24,749 INFO L480 AbstractCegarLoop]: Abstraction has 976 states and 1662 transitions. [2018-09-26 08:07:24,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1662 transitions. [2018-09-26 08:07:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:24,750 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:24,750 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:24,751 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:24,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash -29706655, now seen corresponding path program 2 times [2018-09-26 08:07:24,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:24,762 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:24,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:24,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:24,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:24,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:24,763 INFO L87 Difference]: Start difference. First operand 976 states and 1662 transitions. Second operand 10 states. [2018-09-26 08:07:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:25,362 INFO L93 Difference]: Finished difference Result 1198 states and 2004 transitions. [2018-09-26 08:07:25,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:25,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:07:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:25,366 INFO L225 Difference]: With dead ends: 1198 [2018-09-26 08:07:25,366 INFO L226 Difference]: Without dead ends: 1196 [2018-09-26 08:07:25,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:07:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-09-26 08:07:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 998. [2018-09-26 08:07:25,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-09-26 08:07:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1695 transitions. [2018-09-26 08:07:25,820 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1695 transitions. Word has length 15 [2018-09-26 08:07:25,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:25,820 INFO L480 AbstractCegarLoop]: Abstraction has 998 states and 1695 transitions. [2018-09-26 08:07:25,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1695 transitions. [2018-09-26 08:07:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:07:25,821 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:25,822 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:25,822 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:25,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:25,822 INFO L82 PathProgramCache]: Analyzing trace with hash 10436366, now seen corresponding path program 2 times [2018-09-26 08:07:25,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:25,832 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:25,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:25,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:25,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:25,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:25,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:25,833 INFO L87 Difference]: Start difference. First operand 998 states and 1695 transitions. Second operand 10 states. [2018-09-26 08:07:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:26,411 INFO L93 Difference]: Finished difference Result 1161 states and 1935 transitions. [2018-09-26 08:07:26,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:07:26,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 08:07:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:26,414 INFO L225 Difference]: With dead ends: 1161 [2018-09-26 08:07:26,414 INFO L226 Difference]: Without dead ends: 1159 [2018-09-26 08:07:26,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:07:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-09-26 08:07:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1022. [2018-09-26 08:07:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2018-09-26 08:07:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1728 transitions. [2018-09-26 08:07:26,795 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1728 transitions. Word has length 15 [2018-09-26 08:07:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:26,795 INFO L480 AbstractCegarLoop]: Abstraction has 1022 states and 1728 transitions. [2018-09-26 08:07:26,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1728 transitions. [2018-09-26 08:07:26,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:26,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:26,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:26,797 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:26,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:26,797 INFO L82 PathProgramCache]: Analyzing trace with hash 415120859, now seen corresponding path program 1 times [2018-09-26 08:07:26,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:26,814 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:26,814 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:26,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:26,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:26,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:26,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:26,815 INFO L87 Difference]: Start difference. First operand 1022 states and 1728 transitions. Second operand 10 states. [2018-09-26 08:07:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:27,399 INFO L93 Difference]: Finished difference Result 1173 states and 1946 transitions. [2018-09-26 08:07:27,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:27,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-26 08:07:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:27,401 INFO L225 Difference]: With dead ends: 1173 [2018-09-26 08:07:27,401 INFO L226 Difference]: Without dead ends: 1171 [2018-09-26 08:07:27,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:07:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2018-09-26 08:07:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1065. [2018-09-26 08:07:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2018-09-26 08:07:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1806 transitions. [2018-09-26 08:07:27,814 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1806 transitions. Word has length 16 [2018-09-26 08:07:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:27,814 INFO L480 AbstractCegarLoop]: Abstraction has 1065 states and 1806 transitions. [2018-09-26 08:07:27,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1806 transitions. [2018-09-26 08:07:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:27,815 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:27,815 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:27,816 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:27,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:27,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1829543949, now seen corresponding path program 1 times [2018-09-26 08:07:27,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:27,824 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:27,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:27,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:27,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:27,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:27,825 INFO L87 Difference]: Start difference. First operand 1065 states and 1806 transitions. Second operand 7 states. [2018-09-26 08:07:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:28,572 INFO L93 Difference]: Finished difference Result 2706 states and 4565 transitions. [2018-09-26 08:07:28,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:07:28,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-09-26 08:07:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:28,575 INFO L225 Difference]: With dead ends: 2706 [2018-09-26 08:07:28,575 INFO L226 Difference]: Without dead ends: 1625 [2018-09-26 08:07:28,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2018-09-26 08:07:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1258. [2018-09-26 08:07:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1258 states. [2018-09-26 08:07:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 2139 transitions. [2018-09-26 08:07:29,063 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 2139 transitions. Word has length 16 [2018-09-26 08:07:29,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:29,063 INFO L480 AbstractCegarLoop]: Abstraction has 1258 states and 2139 transitions. [2018-09-26 08:07:29,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 2139 transitions. [2018-09-26 08:07:29,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:29,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:29,065 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:29,065 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:29,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:29,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1269790439, now seen corresponding path program 1 times [2018-09-26 08:07:29,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:29,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:29,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:29,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:29,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:29,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:29,074 INFO L87 Difference]: Start difference. First operand 1258 states and 2139 transitions. Second operand 7 states. [2018-09-26 08:07:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:29,830 INFO L93 Difference]: Finished difference Result 3012 states and 5088 transitions. [2018-09-26 08:07:29,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:29,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-09-26 08:07:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:29,834 INFO L225 Difference]: With dead ends: 3012 [2018-09-26 08:07:29,834 INFO L226 Difference]: Without dead ends: 1713 [2018-09-26 08:07:29,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2018-09-26 08:07:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1521. [2018-09-26 08:07:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-26 08:07:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2545 transitions. [2018-09-26 08:07:30,468 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2545 transitions. Word has length 16 [2018-09-26 08:07:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:30,468 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 2545 transitions. [2018-09-26 08:07:30,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2545 transitions. [2018-09-26 08:07:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:30,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:30,470 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:30,471 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:30,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:30,471 INFO L82 PathProgramCache]: Analyzing trace with hash 323600233, now seen corresponding path program 2 times [2018-09-26 08:07:30,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:30,479 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:30,480 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:30,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:30,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:30,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:30,480 INFO L87 Difference]: Start difference. First operand 1521 states and 2545 transitions. Second operand 7 states. [2018-09-26 08:07:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:31,509 INFO L93 Difference]: Finished difference Result 3615 states and 5961 transitions. [2018-09-26 08:07:31,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:31,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-09-26 08:07:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:31,514 INFO L225 Difference]: With dead ends: 3615 [2018-09-26 08:07:31,514 INFO L226 Difference]: Without dead ends: 2069 [2018-09-26 08:07:31,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2018-09-26 08:07:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1724. [2018-09-26 08:07:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2018-09-26 08:07:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2809 transitions. [2018-09-26 08:07:32,249 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2809 transitions. Word has length 16 [2018-09-26 08:07:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:32,249 INFO L480 AbstractCegarLoop]: Abstraction has 1724 states and 2809 transitions. [2018-09-26 08:07:32,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2809 transitions. [2018-09-26 08:07:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:07:32,251 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:32,251 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:32,251 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:32,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:32,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1273855967, now seen corresponding path program 2 times [2018-09-26 08:07:32,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:32,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:32,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:32,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:32,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:32,270 INFO L87 Difference]: Start difference. First operand 1724 states and 2809 transitions. Second operand 11 states. [2018-09-26 08:07:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:33,318 INFO L93 Difference]: Finished difference Result 1829 states and 2955 transitions. [2018-09-26 08:07:33,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:07:33,319 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-09-26 08:07:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:33,323 INFO L225 Difference]: With dead ends: 1829 [2018-09-26 08:07:33,323 INFO L226 Difference]: Without dead ends: 1820 [2018-09-26 08:07:33,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:07:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2018-09-26 08:07:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1714. [2018-09-26 08:07:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2018-09-26 08:07:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2793 transitions. [2018-09-26 08:07:34,166 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2793 transitions. Word has length 17 [2018-09-26 08:07:34,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:34,167 INFO L480 AbstractCegarLoop]: Abstraction has 1714 states and 2793 transitions. [2018-09-26 08:07:34,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2793 transitions. [2018-09-26 08:07:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:34,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:34,168 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:07:34,169 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:34,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1080543844, now seen corresponding path program 1 times [2018-09-26 08:07:34,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:34,200 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:34,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:34,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:34,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:34,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:34,201 INFO L87 Difference]: Start difference. First operand 1714 states and 2793 transitions. Second operand 12 states. [2018-09-26 08:07:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:35,297 INFO L93 Difference]: Finished difference Result 1784 states and 2895 transitions. [2018-09-26 08:07:35,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:07:35,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-09-26 08:07:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:35,300 INFO L225 Difference]: With dead ends: 1784 [2018-09-26 08:07:35,300 INFO L226 Difference]: Without dead ends: 1783 [2018-09-26 08:07:35,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:35,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2018-09-26 08:07:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1719. [2018-09-26 08:07:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2018-09-26 08:07:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2802 transitions. [2018-09-26 08:07:36,157 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2802 transitions. Word has length 18 [2018-09-26 08:07:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:36,157 INFO L480 AbstractCegarLoop]: Abstraction has 1719 states and 2802 transitions. [2018-09-26 08:07:36,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2802 transitions. [2018-09-26 08:07:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:36,159 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:36,159 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:36,160 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:36,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:36,160 INFO L82 PathProgramCache]: Analyzing trace with hash 818532565, now seen corresponding path program 1 times [2018-09-26 08:07:36,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:36,187 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:36,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:36,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:36,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:36,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:36,188 INFO L87 Difference]: Start difference. First operand 1719 states and 2802 transitions. Second operand 12 states. [2018-09-26 08:07:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:37,123 INFO L93 Difference]: Finished difference Result 1783 states and 2889 transitions. [2018-09-26 08:07:37,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:07:37,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-09-26 08:07:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:37,125 INFO L225 Difference]: With dead ends: 1783 [2018-09-26 08:07:37,126 INFO L226 Difference]: Without dead ends: 1781 [2018-09-26 08:07:37,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:07:37,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-09-26 08:07:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1723. [2018-09-26 08:07:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-09-26 08:07:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2809 transitions. [2018-09-26 08:07:37,992 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2809 transitions. Word has length 18 [2018-09-26 08:07:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:37,993 INFO L480 AbstractCegarLoop]: Abstraction has 1723 states and 2809 transitions. [2018-09-26 08:07:37,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2809 transitions. [2018-09-26 08:07:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:37,995 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:37,995 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:07:37,995 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:37,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1629794958, now seen corresponding path program 2 times [2018-09-26 08:07:37,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:38,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:38,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:38,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:38,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:38,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:38,021 INFO L87 Difference]: Start difference. First operand 1723 states and 2809 transitions. Second operand 12 states. [2018-09-26 08:07:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:39,095 INFO L93 Difference]: Finished difference Result 2036 states and 3314 transitions. [2018-09-26 08:07:39,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:39,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-09-26 08:07:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:39,097 INFO L225 Difference]: With dead ends: 2036 [2018-09-26 08:07:39,097 INFO L226 Difference]: Without dead ends: 2035 [2018-09-26 08:07:39,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:07:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2018-09-26 08:07:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1858. [2018-09-26 08:07:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2018-09-26 08:07:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 3040 transitions. [2018-09-26 08:07:39,850 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 3040 transitions. Word has length 18 [2018-09-26 08:07:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:39,851 INFO L480 AbstractCegarLoop]: Abstraction has 1858 states and 3040 transitions. [2018-09-26 08:07:39,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 3040 transitions. [2018-09-26 08:07:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:39,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:39,852 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:39,852 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:39,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:39,852 INFO L82 PathProgramCache]: Analyzing trace with hash -446449989, now seen corresponding path program 1 times [2018-09-26 08:07:39,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:39,869 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:39,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:39,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:39,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:39,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:39,870 INFO L87 Difference]: Start difference. First operand 1858 states and 3040 transitions. Second operand 11 states. [2018-09-26 08:07:40,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:40,975 INFO L93 Difference]: Finished difference Result 2046 states and 3338 transitions. [2018-09-26 08:07:40,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:07:40,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:40,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:40,977 INFO L225 Difference]: With dead ends: 2046 [2018-09-26 08:07:40,977 INFO L226 Difference]: Without dead ends: 2044 [2018-09-26 08:07:40,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:07:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2018-09-26 08:07:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1922. [2018-09-26 08:07:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-09-26 08:07:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 3155 transitions. [2018-09-26 08:07:41,745 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 3155 transitions. Word has length 18 [2018-09-26 08:07:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:41,745 INFO L480 AbstractCegarLoop]: Abstraction has 1922 states and 3155 transitions. [2018-09-26 08:07:41,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 3155 transitions. [2018-09-26 08:07:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:41,747 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:41,747 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:41,747 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:41,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-09-26 08:07:41,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:41,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:41,761 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:41,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:41,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:41,762 INFO L87 Difference]: Start difference. First operand 1922 states and 3155 transitions. Second operand 11 states. [2018-09-26 08:07:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:42,822 INFO L93 Difference]: Finished difference Result 2251 states and 3688 transitions. [2018-09-26 08:07:42,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:42,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:42,825 INFO L225 Difference]: With dead ends: 2251 [2018-09-26 08:07:42,825 INFO L226 Difference]: Without dead ends: 2249 [2018-09-26 08:07:42,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:07:42,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2018-09-26 08:07:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2029. [2018-09-26 08:07:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-09-26 08:07:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3346 transitions. [2018-09-26 08:07:43,739 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3346 transitions. Word has length 18 [2018-09-26 08:07:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:43,739 INFO L480 AbstractCegarLoop]: Abstraction has 2029 states and 3346 transitions. [2018-09-26 08:07:43,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3346 transitions. [2018-09-26 08:07:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:43,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:43,741 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:43,742 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:43,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:43,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310343, now seen corresponding path program 3 times [2018-09-26 08:07:43,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:43,756 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:43,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:43,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:43,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:43,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:43,756 INFO L87 Difference]: Start difference. First operand 2029 states and 3346 transitions. Second operand 13 states. [2018-09-26 08:07:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:44,677 INFO L93 Difference]: Finished difference Result 2101 states and 3451 transitions. [2018-09-26 08:07:44,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:44,677 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-26 08:07:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:44,680 INFO L225 Difference]: With dead ends: 2101 [2018-09-26 08:07:44,680 INFO L226 Difference]: Without dead ends: 2100 [2018-09-26 08:07:44,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2018-09-26 08:07:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2029. [2018-09-26 08:07:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-09-26 08:07:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3343 transitions. [2018-09-26 08:07:45,507 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3343 transitions. Word has length 18 [2018-09-26 08:07:45,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:45,508 INFO L480 AbstractCegarLoop]: Abstraction has 2029 states and 3343 transitions. [2018-09-26 08:07:45,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3343 transitions. [2018-09-26 08:07:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:45,509 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:45,509 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:45,510 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:45,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:45,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1235464429, now seen corresponding path program 2 times [2018-09-26 08:07:45,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:45,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:45,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:45,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:45,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:45,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:45,524 INFO L87 Difference]: Start difference. First operand 2029 states and 3343 transitions. Second operand 11 states. [2018-09-26 08:07:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:46,618 INFO L93 Difference]: Finished difference Result 2256 states and 3702 transitions. [2018-09-26 08:07:46,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:07:46,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:46,620 INFO L225 Difference]: With dead ends: 2256 [2018-09-26 08:07:46,620 INFO L226 Difference]: Without dead ends: 2254 [2018-09-26 08:07:46,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:07:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2018-09-26 08:07:47,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2040. [2018-09-26 08:07:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2018-09-26 08:07:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 3369 transitions. [2018-09-26 08:07:47,439 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 3369 transitions. Word has length 18 [2018-09-26 08:07:47,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:47,439 INFO L480 AbstractCegarLoop]: Abstraction has 2040 states and 3369 transitions. [2018-09-26 08:07:47,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 3369 transitions. [2018-09-26 08:07:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:47,441 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:47,441 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:07:47,441 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:47,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:47,441 INFO L82 PathProgramCache]: Analyzing trace with hash -111984382, now seen corresponding path program 4 times [2018-09-26 08:07:47,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:47,454 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:47,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:47,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:47,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:47,455 INFO L87 Difference]: Start difference. First operand 2040 states and 3369 transitions. Second operand 12 states. [2018-09-26 08:07:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:48,627 INFO L93 Difference]: Finished difference Result 2243 states and 3672 transitions. [2018-09-26 08:07:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:07:48,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-09-26 08:07:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:48,629 INFO L225 Difference]: With dead ends: 2243 [2018-09-26 08:07:48,629 INFO L226 Difference]: Without dead ends: 2242 [2018-09-26 08:07:48,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:07:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2018-09-26 08:07:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2029. [2018-09-26 08:07:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-09-26 08:07:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3348 transitions. [2018-09-26 08:07:49,458 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3348 transitions. Word has length 18 [2018-09-26 08:07:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:49,458 INFO L480 AbstractCegarLoop]: Abstraction has 2029 states and 3348 transitions. [2018-09-26 08:07:49,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3348 transitions. [2018-09-26 08:07:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:49,460 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:49,460 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:49,460 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:49,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:49,460 INFO L82 PathProgramCache]: Analyzing trace with hash -111983100, now seen corresponding path program 1 times [2018-09-26 08:07:49,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:49,471 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:49,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:49,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:49,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:49,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:49,472 INFO L87 Difference]: Start difference. First operand 2029 states and 3348 transitions. Second operand 11 states. [2018-09-26 08:07:50,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:50,765 INFO L93 Difference]: Finished difference Result 2267 states and 3717 transitions. [2018-09-26 08:07:50,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:07:50,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:50,767 INFO L225 Difference]: With dead ends: 2267 [2018-09-26 08:07:50,768 INFO L226 Difference]: Without dead ends: 2265 [2018-09-26 08:07:50,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:07:50,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2018-09-26 08:07:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2063. [2018-09-26 08:07:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2018-09-26 08:07:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 3413 transitions. [2018-09-26 08:07:51,673 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 3413 transitions. Word has length 18 [2018-09-26 08:07:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:51,673 INFO L480 AbstractCegarLoop]: Abstraction has 2063 states and 3413 transitions. [2018-09-26 08:07:51,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 3413 transitions. [2018-09-26 08:07:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:51,675 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:51,675 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:51,675 INFO L423 AbstractCegarLoop]: === Iteration 73 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:51,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash -103396213, now seen corresponding path program 2 times [2018-09-26 08:07:51,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:51,690 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:51,690 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:51,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:51,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:51,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:51,691 INFO L87 Difference]: Start difference. First operand 2063 states and 3413 transitions. Second operand 11 states. [2018-09-26 08:07:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:52,843 INFO L93 Difference]: Finished difference Result 2234 states and 3657 transitions. [2018-09-26 08:07:52,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:52,843 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:52,845 INFO L225 Difference]: With dead ends: 2234 [2018-09-26 08:07:52,845 INFO L226 Difference]: Without dead ends: 2232 [2018-09-26 08:07:52,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:07:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2018-09-26 08:07:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2062. [2018-09-26 08:07:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2018-09-26 08:07:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 3410 transitions. [2018-09-26 08:07:53,753 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 3410 transitions. Word has length 18 [2018-09-26 08:07:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:53,753 INFO L480 AbstractCegarLoop]: Abstraction has 2062 states and 3410 transitions. [2018-09-26 08:07:53,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 3410 transitions. [2018-09-26 08:07:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:53,755 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:53,755 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:53,755 INFO L423 AbstractCegarLoop]: === Iteration 74 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:53,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:53,755 INFO L82 PathProgramCache]: Analyzing trace with hash -103395925, now seen corresponding path program 5 times [2018-09-26 08:07:53,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:53,774 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:53,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:53,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:53,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:53,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:53,775 INFO L87 Difference]: Start difference. First operand 2062 states and 3410 transitions. Second operand 13 states. [2018-09-26 08:07:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:54,901 INFO L93 Difference]: Finished difference Result 2220 states and 3648 transitions. [2018-09-26 08:07:54,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:54,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-26 08:07:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:54,904 INFO L225 Difference]: With dead ends: 2220 [2018-09-26 08:07:54,904 INFO L226 Difference]: Without dead ends: 2219 [2018-09-26 08:07:54,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:07:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2018-09-26 08:07:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2062. [2018-09-26 08:07:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2018-09-26 08:07:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 3406 transitions. [2018-09-26 08:07:55,774 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 3406 transitions. Word has length 18 [2018-09-26 08:07:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:55,774 INFO L480 AbstractCegarLoop]: Abstraction has 2062 states and 3406 transitions. [2018-09-26 08:07:55,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 3406 transitions. [2018-09-26 08:07:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:55,775 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:55,775 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:55,776 INFO L423 AbstractCegarLoop]: === Iteration 75 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:55,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:55,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-09-26 08:07:55,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:55,788 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:55,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:55,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:55,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:55,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:55,789 INFO L87 Difference]: Start difference. First operand 2062 states and 3406 transitions. Second operand 11 states. [2018-09-26 08:07:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:57,004 INFO L93 Difference]: Finished difference Result 2348 states and 3848 transitions. [2018-09-26 08:07:57,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:07:57,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:57,007 INFO L225 Difference]: With dead ends: 2348 [2018-09-26 08:07:57,007 INFO L226 Difference]: Without dead ends: 2346 [2018-09-26 08:07:57,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:07:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2018-09-26 08:07:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2069. [2018-09-26 08:07:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2069 states. [2018-09-26 08:07:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3421 transitions. [2018-09-26 08:07:57,935 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3421 transitions. Word has length 18 [2018-09-26 08:07:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:57,935 INFO L480 AbstractCegarLoop]: Abstraction has 2069 states and 3421 transitions. [2018-09-26 08:07:57,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3421 transitions. [2018-09-26 08:07:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:57,936 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:57,936 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:57,936 INFO L423 AbstractCegarLoop]: === Iteration 76 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:57,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:57,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 3 times [2018-09-26 08:07:57,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:57,949 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:57,949 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:57,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:57,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:57,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:57,950 INFO L87 Difference]: Start difference. First operand 2069 states and 3421 transitions. Second operand 11 states. [2018-09-26 08:07:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:59,149 INFO L93 Difference]: Finished difference Result 2308 states and 3773 transitions. [2018-09-26 08:07:59,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:07:59,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:59,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:59,152 INFO L225 Difference]: With dead ends: 2308 [2018-09-26 08:07:59,152 INFO L226 Difference]: Without dead ends: 2306 [2018-09-26 08:07:59,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:07:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2018-09-26 08:08:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2060. [2018-09-26 08:08:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2060 states. [2018-09-26 08:08:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 3397 transitions. [2018-09-26 08:08:00,014 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 3397 transitions. Word has length 18 [2018-09-26 08:08:00,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:00,015 INFO L480 AbstractCegarLoop]: Abstraction has 2060 states and 3397 transitions. [2018-09-26 08:08:00,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:00,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 3397 transitions. [2018-09-26 08:08:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:08:00,016 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:00,016 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:00,016 INFO L423 AbstractCegarLoop]: === Iteration 77 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:00,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:00,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170099, now seen corresponding path program 6 times [2018-09-26 08:08:00,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:00,027 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:00,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:08:00,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:08:00,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:08:00,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:08:00,028 INFO L87 Difference]: Start difference. First operand 2060 states and 3397 transitions. Second operand 13 states. [2018-09-26 08:08:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:01,299 INFO L93 Difference]: Finished difference Result 2308 states and 3783 transitions. [2018-09-26 08:08:01,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:08:01,299 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-09-26 08:08:01,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:01,301 INFO L225 Difference]: With dead ends: 2308 [2018-09-26 08:08:01,301 INFO L226 Difference]: Without dead ends: 2307 [2018-09-26 08:08:01,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:08:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2018-09-26 08:08:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2057. [2018-09-26 08:08:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2018-09-26 08:08:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3387 transitions. [2018-09-26 08:08:02,184 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3387 transitions. Word has length 18 [2018-09-26 08:08:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:02,184 INFO L480 AbstractCegarLoop]: Abstraction has 2057 states and 3387 transitions. [2018-09-26 08:08:02,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:08:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3387 transitions. [2018-09-26 08:08:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:08:02,185 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:02,185 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:02,185 INFO L423 AbstractCegarLoop]: === Iteration 78 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:02,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:02,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1198893179, now seen corresponding path program 4 times [2018-09-26 08:08:02,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:02,198 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:02,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:02,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:02,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:02,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:02,199 INFO L87 Difference]: Start difference. First operand 2057 states and 3387 transitions. Second operand 11 states. [2018-09-26 08:08:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:03,496 INFO L93 Difference]: Finished difference Result 2380 states and 3900 transitions. [2018-09-26 08:08:03,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:08:03,497 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:08:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:03,499 INFO L225 Difference]: With dead ends: 2380 [2018-09-26 08:08:03,499 INFO L226 Difference]: Without dead ends: 2378 [2018-09-26 08:08:03,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:08:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2018-09-26 08:08:04,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2049. [2018-09-26 08:08:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2018-09-26 08:08:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 3368 transitions. [2018-09-26 08:08:04,386 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 3368 transitions. Word has length 18 [2018-09-26 08:08:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:04,387 INFO L480 AbstractCegarLoop]: Abstraction has 2049 states and 3368 transitions. [2018-09-26 08:08:04,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 3368 transitions. [2018-09-26 08:08:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:08:04,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:04,388 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:04,388 INFO L423 AbstractCegarLoop]: === Iteration 79 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:04,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:04,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1428793719, now seen corresponding path program 1 times [2018-09-26 08:08:04,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:04,405 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:04,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:04,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:04,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:04,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:04,406 INFO L87 Difference]: Start difference. First operand 2049 states and 3368 transitions. Second operand 11 states. [2018-09-26 08:08:05,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:05,583 INFO L93 Difference]: Finished difference Result 2143 states and 3512 transitions. [2018-09-26 08:08:05,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:08:05,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:08:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:05,585 INFO L225 Difference]: With dead ends: 2143 [2018-09-26 08:08:05,585 INFO L226 Difference]: Without dead ends: 2141 [2018-09-26 08:08:05,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:08:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2018-09-26 08:08:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2055. [2018-09-26 08:08:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2018-09-26 08:08:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3378 transitions. [2018-09-26 08:08:06,473 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3378 transitions. Word has length 18 [2018-09-26 08:08:06,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:06,473 INFO L480 AbstractCegarLoop]: Abstraction has 2055 states and 3378 transitions. [2018-09-26 08:08:06,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3378 transitions. [2018-09-26 08:08:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:08:06,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:06,474 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:06,475 INFO L423 AbstractCegarLoop]: === Iteration 80 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:06,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:06,475 INFO L82 PathProgramCache]: Analyzing trace with hash 383805696, now seen corresponding path program 1 times [2018-09-26 08:08:06,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:06,490 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:08:06,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:06,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:06,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:06,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:06,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:06,491 INFO L87 Difference]: Start difference. First operand 2055 states and 3378 transitions. Second operand 11 states. [2018-09-26 08:08:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:07,636 INFO L93 Difference]: Finished difference Result 2243 states and 3674 transitions. [2018-09-26 08:08:07,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:08:07,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:08:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:07,638 INFO L225 Difference]: With dead ends: 2243 [2018-09-26 08:08:07,638 INFO L226 Difference]: Without dead ends: 2241 [2018-09-26 08:08:07,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:08:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2018-09-26 08:08:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2072. [2018-09-26 08:08:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-09-26 08:08:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3406 transitions. [2018-09-26 08:08:08,560 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3406 transitions. Word has length 18 [2018-09-26 08:08:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:08,560 INFO L480 AbstractCegarLoop]: Abstraction has 2072 states and 3406 transitions. [2018-09-26 08:08:08,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3406 transitions. [2018-09-26 08:08:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:08,562 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:08,562 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:08,562 INFO L423 AbstractCegarLoop]: === Iteration 81 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:08,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-09-26 08:08:08,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:08,590 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:08,590 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:08:08,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:08:08,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:08:08,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:08:08,591 INFO L87 Difference]: Start difference. First operand 2072 states and 3406 transitions. Second operand 13 states. [2018-09-26 08:08:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:09,722 INFO L93 Difference]: Finished difference Result 2153 states and 3525 transitions. [2018-09-26 08:08:09,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:08:09,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-09-26 08:08:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:09,724 INFO L225 Difference]: With dead ends: 2153 [2018-09-26 08:08:09,724 INFO L226 Difference]: Without dead ends: 2152 [2018-09-26 08:08:09,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:08:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2018-09-26 08:08:10,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2082. [2018-09-26 08:08:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2018-09-26 08:08:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3423 transitions. [2018-09-26 08:08:10,643 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3423 transitions. Word has length 19 [2018-09-26 08:08:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:10,643 INFO L480 AbstractCegarLoop]: Abstraction has 2082 states and 3423 transitions. [2018-09-26 08:08:10,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:08:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3423 transitions. [2018-09-26 08:08:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:10,645 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:10,645 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:10,645 INFO L423 AbstractCegarLoop]: === Iteration 82 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:10,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1639758835, now seen corresponding path program 1 times [2018-09-26 08:08:10,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:10,667 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:10,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:08:10,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:08:10,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:08:10,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:08:10,668 INFO L87 Difference]: Start difference. First operand 2082 states and 3423 transitions. Second operand 13 states. [2018-09-26 08:08:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:11,854 INFO L93 Difference]: Finished difference Result 2189 states and 3589 transitions. [2018-09-26 08:08:11,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:08:11,854 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-09-26 08:08:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:11,856 INFO L225 Difference]: With dead ends: 2189 [2018-09-26 08:08:11,856 INFO L226 Difference]: Without dead ends: 2187 [2018-09-26 08:08:11,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:08:11,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-09-26 08:08:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2100. [2018-09-26 08:08:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2018-09-26 08:08:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3458 transitions. [2018-09-26 08:08:12,788 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3458 transitions. Word has length 19 [2018-09-26 08:08:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:12,789 INFO L480 AbstractCegarLoop]: Abstraction has 2100 states and 3458 transitions. [2018-09-26 08:08:12,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:08:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3458 transitions. [2018-09-26 08:08:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:12,790 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:12,790 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:12,790 INFO L423 AbstractCegarLoop]: === Iteration 83 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:12,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:12,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2095454951, now seen corresponding path program 2 times [2018-09-26 08:08:12,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:12,812 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:12,812 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:12,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:12,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:12,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:12,812 INFO L87 Difference]: Start difference. First operand 2100 states and 3458 transitions. Second operand 12 states. [2018-09-26 08:08:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:14,099 INFO L93 Difference]: Finished difference Result 2277 states and 3736 transitions. [2018-09-26 08:08:14,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:08:14,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-09-26 08:08:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:14,102 INFO L225 Difference]: With dead ends: 2277 [2018-09-26 08:08:14,102 INFO L226 Difference]: Without dead ends: 2275 [2018-09-26 08:08:14,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:08:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2018-09-26 08:08:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2170. [2018-09-26 08:08:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2018-09-26 08:08:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3573 transitions. [2018-09-26 08:08:15,089 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3573 transitions. Word has length 19 [2018-09-26 08:08:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:15,089 INFO L480 AbstractCegarLoop]: Abstraction has 2170 states and 3573 transitions. [2018-09-26 08:08:15,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3573 transitions. [2018-09-26 08:08:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:15,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:15,090 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:15,091 INFO L423 AbstractCegarLoop]: === Iteration 84 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:15,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:15,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1599772939, now seen corresponding path program 3 times [2018-09-26 08:08:15,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:15,106 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:15,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:15,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:15,107 INFO L87 Difference]: Start difference. First operand 2170 states and 3573 transitions. Second operand 12 states. [2018-09-26 08:08:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:16,574 INFO L93 Difference]: Finished difference Result 2400 states and 3933 transitions. [2018-09-26 08:08:16,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:08:16,574 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-09-26 08:08:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:16,576 INFO L225 Difference]: With dead ends: 2400 [2018-09-26 08:08:16,577 INFO L226 Difference]: Without dead ends: 2398 [2018-09-26 08:08:16,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:08:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2018-09-26 08:08:17,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2146. [2018-09-26 08:08:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2018-09-26 08:08:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3536 transitions. [2018-09-26 08:08:17,599 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3536 transitions. Word has length 19 [2018-09-26 08:08:17,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:17,599 INFO L480 AbstractCegarLoop]: Abstraction has 2146 states and 3536 transitions. [2018-09-26 08:08:17,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:17,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3536 transitions. [2018-09-26 08:08:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:17,601 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:17,601 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:17,601 INFO L423 AbstractCegarLoop]: === Iteration 85 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:17,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1654744567, now seen corresponding path program 1 times [2018-09-26 08:08:17,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 08:08:17,611 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:17,611 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:08:17,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:08:17,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:08:17,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:08:17,612 INFO L87 Difference]: Start difference. First operand 2146 states and 3536 transitions. Second operand 8 states. [2018-09-26 08:08:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:18,938 INFO L93 Difference]: Finished difference Result 4383 states and 7138 transitions. [2018-09-26 08:08:18,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:08:18,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-09-26 08:08:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:18,941 INFO L225 Difference]: With dead ends: 4383 [2018-09-26 08:08:18,941 INFO L226 Difference]: Without dead ends: 2069 [2018-09-26 08:08:18,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:08:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2018-09-26 08:08:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1775. [2018-09-26 08:08:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2018-09-26 08:08:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2940 transitions. [2018-09-26 08:08:19,795 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2940 transitions. Word has length 19 [2018-09-26 08:08:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:19,796 INFO L480 AbstractCegarLoop]: Abstraction has 1775 states and 2940 transitions. [2018-09-26 08:08:19,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:08:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2940 transitions. [2018-09-26 08:08:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:19,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:19,797 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:19,797 INFO L423 AbstractCegarLoop]: === Iteration 86 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:19,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times [2018-09-26 08:08:19,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:19,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:19,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:08:19,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:08:19,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:08:19,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:08:19,813 INFO L87 Difference]: Start difference. First operand 1775 states and 2940 transitions. Second operand 13 states. [2018-09-26 08:08:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:21,234 INFO L93 Difference]: Finished difference Result 2136 states and 3539 transitions. [2018-09-26 08:08:21,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:08:21,234 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-09-26 08:08:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:21,236 INFO L225 Difference]: With dead ends: 2136 [2018-09-26 08:08:21,236 INFO L226 Difference]: Without dead ends: 2134 [2018-09-26 08:08:21,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:08:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2018-09-26 08:08:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1982. [2018-09-26 08:08:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-09-26 08:08:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 3302 transitions. [2018-09-26 08:08:22,314 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 3302 transitions. Word has length 19 [2018-09-26 08:08:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:22,314 INFO L480 AbstractCegarLoop]: Abstraction has 1982 states and 3302 transitions. [2018-09-26 08:08:22,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:08:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 3302 transitions. [2018-09-26 08:08:22,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:22,316 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:22,316 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:22,316 INFO L423 AbstractCegarLoop]: === Iteration 87 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:22,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:22,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times [2018-09-26 08:08:22,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:22,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:22,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:08:22,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:08:22,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:08:22,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:08:22,332 INFO L87 Difference]: Start difference. First operand 1982 states and 3302 transitions. Second operand 13 states. [2018-09-26 08:08:24,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:24,576 INFO L93 Difference]: Finished difference Result 2923 states and 4923 transitions. [2018-09-26 08:08:24,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:08:24,576 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-09-26 08:08:24,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:24,579 INFO L225 Difference]: With dead ends: 2923 [2018-09-26 08:08:24,580 INFO L226 Difference]: Without dead ends: 2921 [2018-09-26 08:08:24,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:08:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2018-09-26 08:08:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2165. [2018-09-26 08:08:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2165 states. [2018-09-26 08:08:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3628 transitions. [2018-09-26 08:08:25,667 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3628 transitions. Word has length 19 [2018-09-26 08:08:25,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:25,667 INFO L480 AbstractCegarLoop]: Abstraction has 2165 states and 3628 transitions. [2018-09-26 08:08:25,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:08:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3628 transitions. [2018-09-26 08:08:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:25,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:25,668 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:25,669 INFO L423 AbstractCegarLoop]: === Iteration 88 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:25,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1180644619, now seen corresponding path program 1 times [2018-09-26 08:08:25,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:25,686 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:25,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:25,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:25,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:25,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:25,687 INFO L87 Difference]: Start difference. First operand 2165 states and 3628 transitions. Second operand 12 states. [2018-09-26 08:08:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:27,383 INFO L93 Difference]: Finished difference Result 2392 states and 3991 transitions. [2018-09-26 08:08:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:08:27,384 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-09-26 08:08:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:27,386 INFO L225 Difference]: With dead ends: 2392 [2018-09-26 08:08:27,386 INFO L226 Difference]: Without dead ends: 2391 [2018-09-26 08:08:27,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=249, Invalid=1157, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:08:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2018-09-26 08:08:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2238. [2018-09-26 08:08:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2238 states. [2018-09-26 08:08:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3754 transitions. [2018-09-26 08:08:28,521 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3754 transitions. Word has length 19 [2018-09-26 08:08:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:28,521 INFO L480 AbstractCegarLoop]: Abstraction has 2238 states and 3754 transitions. [2018-09-26 08:08:28,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3754 transitions. [2018-09-26 08:08:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:28,523 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:28,523 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:28,523 INFO L423 AbstractCegarLoop]: === Iteration 89 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:28,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:28,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1537034535, now seen corresponding path program 1 times [2018-09-26 08:08:28,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:28,539 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:28,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:28,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:28,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:28,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:28,540 INFO L87 Difference]: Start difference. First operand 2238 states and 3754 transitions. Second operand 12 states. [2018-09-26 08:08:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:30,236 INFO L93 Difference]: Finished difference Result 2500 states and 4176 transitions. [2018-09-26 08:08:30,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:08:30,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-09-26 08:08:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:30,239 INFO L225 Difference]: With dead ends: 2500 [2018-09-26 08:08:30,239 INFO L226 Difference]: Without dead ends: 2498 [2018-09-26 08:08:30,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=464, Invalid=1888, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:08:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2018-09-26 08:08:31,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2319. [2018-09-26 08:08:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2319 states. [2018-09-26 08:08:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3903 transitions. [2018-09-26 08:08:31,459 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3903 transitions. Word has length 19 [2018-09-26 08:08:31,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:31,459 INFO L480 AbstractCegarLoop]: Abstraction has 2319 states and 3903 transitions. [2018-09-26 08:08:31,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3903 transitions. [2018-09-26 08:08:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:31,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:31,461 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:31,461 INFO L423 AbstractCegarLoop]: === Iteration 90 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:31,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1313246452, now seen corresponding path program 2 times [2018-09-26 08:08:31,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:31,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:31,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:08:31,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:08:31,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:08:31,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:08:31,474 INFO L87 Difference]: Start difference. First operand 2319 states and 3903 transitions. Second operand 13 states. [2018-09-26 08:08:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:33,769 INFO L93 Difference]: Finished difference Result 3166 states and 5350 transitions. [2018-09-26 08:08:33,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:08:33,769 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-09-26 08:08:33,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:33,773 INFO L225 Difference]: With dead ends: 3166 [2018-09-26 08:08:33,773 INFO L226 Difference]: Without dead ends: 3164 [2018-09-26 08:08:33,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:08:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2018-09-26 08:08:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 2660. [2018-09-26 08:08:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2018-09-26 08:08:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 4506 transitions. [2018-09-26 08:08:35,217 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 4506 transitions. Word has length 19 [2018-09-26 08:08:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:35,217 INFO L480 AbstractCegarLoop]: Abstraction has 2660 states and 4506 transitions. [2018-09-26 08:08:35,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:08:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 4506 transitions. [2018-09-26 08:08:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:35,218 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:35,219 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:35,219 INFO L423 AbstractCegarLoop]: === Iteration 91 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:35,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:35,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1262707917, now seen corresponding path program 1 times [2018-09-26 08:08:35,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:35,235 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:35,235 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:35,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:35,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:35,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:35,236 INFO L87 Difference]: Start difference. First operand 2660 states and 4506 transitions. Second operand 12 states. [2018-09-26 08:08:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:37,094 INFO L93 Difference]: Finished difference Result 2926 states and 4919 transitions. [2018-09-26 08:08:37,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:08:37,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-09-26 08:08:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:37,097 INFO L225 Difference]: With dead ends: 2926 [2018-09-26 08:08:37,097 INFO L226 Difference]: Without dead ends: 2925 [2018-09-26 08:08:37,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:08:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2018-09-26 08:08:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2743. [2018-09-26 08:08:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2743 states. [2018-09-26 08:08:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 4635 transitions. [2018-09-26 08:08:38,652 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 4635 transitions. Word has length 19 [2018-09-26 08:08:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:38,652 INFO L480 AbstractCegarLoop]: Abstraction has 2743 states and 4635 transitions. [2018-09-26 08:08:38,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 4635 transitions. [2018-09-26 08:08:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:38,653 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:38,653 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:38,654 INFO L423 AbstractCegarLoop]: === Iteration 92 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:38,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:38,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1454971237, now seen corresponding path program 1 times [2018-09-26 08:08:38,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:38,669 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:38,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:38,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:38,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:38,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:38,670 INFO L87 Difference]: Start difference. First operand 2743 states and 4635 transitions. Second operand 12 states. [2018-09-26 08:08:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:40,812 INFO L93 Difference]: Finished difference Result 3133 states and 5275 transitions. [2018-09-26 08:08:40,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:08:40,812 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-09-26 08:08:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:40,814 INFO L225 Difference]: With dead ends: 3133 [2018-09-26 08:08:40,814 INFO L226 Difference]: Without dead ends: 3131 [2018-09-26 08:08:40,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:08:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2018-09-26 08:08:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2801. [2018-09-26 08:08:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2018-09-26 08:08:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4743 transitions. [2018-09-26 08:08:42,415 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4743 transitions. Word has length 19 [2018-09-26 08:08:42,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:42,415 INFO L480 AbstractCegarLoop]: Abstraction has 2801 states and 4743 transitions. [2018-09-26 08:08:42,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4743 transitions. [2018-09-26 08:08:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:42,416 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:42,416 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:42,416 INFO L423 AbstractCegarLoop]: === Iteration 93 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:42,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:42,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1425507486, now seen corresponding path program 1 times [2018-09-26 08:08:42,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:42,430 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:42,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:42,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:42,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:42,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:42,431 INFO L87 Difference]: Start difference. First operand 2801 states and 4743 transitions. Second operand 12 states. [2018-09-26 08:08:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:44,254 INFO L93 Difference]: Finished difference Result 2901 states and 4876 transitions. [2018-09-26 08:08:44,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:08:44,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-09-26 08:08:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:44,257 INFO L225 Difference]: With dead ends: 2901 [2018-09-26 08:08:44,257 INFO L226 Difference]: Without dead ends: 2899 [2018-09-26 08:08:44,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:08:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2018-09-26 08:08:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2806. [2018-09-26 08:08:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states. [2018-09-26 08:08:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 4747 transitions. [2018-09-26 08:08:45,910 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 4747 transitions. Word has length 19 [2018-09-26 08:08:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:45,910 INFO L480 AbstractCegarLoop]: Abstraction has 2806 states and 4747 transitions. [2018-09-26 08:08:45,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4747 transitions. [2018-09-26 08:08:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:08:45,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:45,912 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:45,912 INFO L423 AbstractCegarLoop]: === Iteration 94 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:45,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1340518044, now seen corresponding path program 3 times [2018-09-26 08:08:45,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:45,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:45,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:08:45,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:08:45,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:08:45,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:08:45,929 INFO L87 Difference]: Start difference. First operand 2806 states and 4747 transitions. Second operand 13 states. [2018-09-26 08:08:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:47,733 INFO L93 Difference]: Finished difference Result 2882 states and 4840 transitions. [2018-09-26 08:08:47,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:08:47,734 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-09-26 08:08:47,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:47,737 INFO L225 Difference]: With dead ends: 2882 [2018-09-26 08:08:47,737 INFO L226 Difference]: Without dead ends: 2881 [2018-09-26 08:08:47,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:08:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2018-09-26 08:08:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2808. [2018-09-26 08:08:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2018-09-26 08:08:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4749 transitions. [2018-09-26 08:08:49,344 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4749 transitions. Word has length 19 [2018-09-26 08:08:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:49,344 INFO L480 AbstractCegarLoop]: Abstraction has 2808 states and 4749 transitions. [2018-09-26 08:08:49,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:08:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4749 transitions. [2018-09-26 08:08:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:08:49,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:49,346 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:49,346 INFO L423 AbstractCegarLoop]: === Iteration 95 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:49,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:49,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1920603351, now seen corresponding path program 2 times [2018-09-26 08:08:49,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:49,360 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:49,360 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:08:49,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:08:49,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:08:49,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:08:49,361 INFO L87 Difference]: Start difference. First operand 2808 states and 4749 transitions. Second operand 13 states. [2018-09-26 08:08:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:51,324 INFO L93 Difference]: Finished difference Result 2926 states and 4924 transitions. [2018-09-26 08:08:51,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:08:51,324 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-09-26 08:08:51,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:51,327 INFO L225 Difference]: With dead ends: 2926 [2018-09-26 08:08:51,327 INFO L226 Difference]: Without dead ends: 2924 [2018-09-26 08:08:51,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:08:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2018-09-26 08:08:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2802. [2018-09-26 08:08:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2018-09-26 08:08:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4737 transitions. [2018-09-26 08:08:52,948 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4737 transitions. Word has length 21 [2018-09-26 08:08:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:52,949 INFO L480 AbstractCegarLoop]: Abstraction has 2802 states and 4737 transitions. [2018-09-26 08:08:52,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:08:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4737 transitions. [2018-09-26 08:08:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:08:52,950 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:52,950 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:52,950 INFO L423 AbstractCegarLoop]: === Iteration 96 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:52,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:52,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1322152835, now seen corresponding path program 1 times [2018-09-26 08:08:52,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:52,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:52,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:52,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:52,964 INFO L87 Difference]: Start difference. First operand 2802 states and 4737 transitions. Second operand 12 states. [2018-09-26 08:08:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:54,864 INFO L93 Difference]: Finished difference Result 2956 states and 4972 transitions. [2018-09-26 08:08:54,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:08:54,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:08:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:54,866 INFO L225 Difference]: With dead ends: 2956 [2018-09-26 08:08:54,867 INFO L226 Difference]: Without dead ends: 2954 [2018-09-26 08:08:54,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:08:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-09-26 08:08:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2817. [2018-09-26 08:08:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2018-09-26 08:08:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4761 transitions. [2018-09-26 08:08:56,503 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 4761 transitions. Word has length 21 [2018-09-26 08:08:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:56,504 INFO L480 AbstractCegarLoop]: Abstraction has 2817 states and 4761 transitions. [2018-09-26 08:08:56,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 4761 transitions. [2018-09-26 08:08:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:08:56,505 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:56,505 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:56,506 INFO L423 AbstractCegarLoop]: === Iteration 97 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:56,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:56,506 INFO L82 PathProgramCache]: Analyzing trace with hash 277164812, now seen corresponding path program 1 times [2018-09-26 08:08:56,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:56,518 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:56,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:56,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:56,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:56,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:56,518 INFO L87 Difference]: Start difference. First operand 2817 states and 4761 transitions. Second operand 12 states. [2018-09-26 08:08:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:58,622 INFO L93 Difference]: Finished difference Result 3140 states and 5289 transitions. [2018-09-26 08:08:58,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:08:58,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:08:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:58,625 INFO L225 Difference]: With dead ends: 3140 [2018-09-26 08:08:58,625 INFO L226 Difference]: Without dead ends: 3138 [2018-09-26 08:08:58,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:08:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-09-26 08:09:00,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2900. [2018-09-26 08:09:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2018-09-26 08:09:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 4905 transitions. [2018-09-26 08:09:00,302 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 4905 transitions. Word has length 21 [2018-09-26 08:09:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:00,302 INFO L480 AbstractCegarLoop]: Abstraction has 2900 states and 4905 transitions. [2018-09-26 08:09:00,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:09:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4905 transitions. [2018-09-26 08:09:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:00,304 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:00,304 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:00,304 INFO L423 AbstractCegarLoop]: === Iteration 98 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:00,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:00,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2146104337, now seen corresponding path program 2 times [2018-09-26 08:09:00,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:00,316 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:00,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:00,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:09:00,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:09:00,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:09:00,317 INFO L87 Difference]: Start difference. First operand 2900 states and 4905 transitions. Second operand 12 states. [2018-09-26 08:09:02,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:02,519 INFO L93 Difference]: Finished difference Result 3107 states and 5227 transitions. [2018-09-26 08:09:02,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:09:02,519 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:09:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:02,522 INFO L225 Difference]: With dead ends: 3107 [2018-09-26 08:09:02,522 INFO L226 Difference]: Without dead ends: 3105 [2018-09-26 08:09:02,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:09:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2018-09-26 08:09:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 2911. [2018-09-26 08:09:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2018-09-26 08:09:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4924 transitions. [2018-09-26 08:09:04,264 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4924 transitions. Word has length 21 [2018-09-26 08:09:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:04,264 INFO L480 AbstractCegarLoop]: Abstraction has 2911 states and 4924 transitions. [2018-09-26 08:09:04,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:09:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4924 transitions. [2018-09-26 08:09:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:04,265 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:04,265 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:04,266 INFO L423 AbstractCegarLoop]: === Iteration 99 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:04,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1101116314, now seen corresponding path program 2 times [2018-09-26 08:09:04,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:04,276 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:04,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:04,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:09:04,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:09:04,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:09:04,277 INFO L87 Difference]: Start difference. First operand 2911 states and 4924 transitions. Second operand 12 states. [2018-09-26 08:09:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:06,350 INFO L93 Difference]: Finished difference Result 3164 states and 5332 transitions. [2018-09-26 08:09:06,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:09:06,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:09:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:06,354 INFO L225 Difference]: With dead ends: 3164 [2018-09-26 08:09:06,354 INFO L226 Difference]: Without dead ends: 3162 [2018-09-26 08:09:06,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:09:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2018-09-26 08:09:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 2915. [2018-09-26 08:09:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2915 states. [2018-09-26 08:09:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4930 transitions. [2018-09-26 08:09:08,112 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4930 transitions. Word has length 21 [2018-09-26 08:09:08,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:08,112 INFO L480 AbstractCegarLoop]: Abstraction has 2915 states and 4930 transitions. [2018-09-26 08:09:08,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:09:08,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4930 transitions. [2018-09-26 08:09:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:08,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:08,114 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:08,114 INFO L423 AbstractCegarLoop]: === Iteration 100 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:08,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:08,114 INFO L82 PathProgramCache]: Analyzing trace with hash -825971080, now seen corresponding path program 3 times [2018-09-26 08:09:08,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:08,128 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:08,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:08,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:09:08,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:09:08,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:09:08,129 INFO L87 Difference]: Start difference. First operand 2915 states and 4930 transitions. Second operand 12 states. [2018-09-26 08:09:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:10,324 INFO L93 Difference]: Finished difference Result 3286 states and 5534 transitions. [2018-09-26 08:09:10,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:09:10,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:09:10,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:10,328 INFO L225 Difference]: With dead ends: 3286 [2018-09-26 08:09:10,328 INFO L226 Difference]: Without dead ends: 3284 [2018-09-26 08:09:10,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:09:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2018-09-26 08:09:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 2815. [2018-09-26 08:09:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2018-09-26 08:09:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 4765 transitions. [2018-09-26 08:09:12,053 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 4765 transitions. Word has length 21 [2018-09-26 08:09:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:12,054 INFO L480 AbstractCegarLoop]: Abstraction has 2815 states and 4765 transitions. [2018-09-26 08:09:12,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:09:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4765 transitions. [2018-09-26 08:09:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:12,055 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:12,056 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:09:12,056 INFO L423 AbstractCegarLoop]: === Iteration 101 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:12,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:12,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1513598179, now seen corresponding path program 3 times [2018-09-26 08:09:12,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:12,071 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:12,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:12,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:09:12,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:09:12,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:09:12,072 INFO L87 Difference]: Start difference. First operand 2815 states and 4765 transitions. Second operand 12 states. [2018-09-26 08:09:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:14,680 INFO L93 Difference]: Finished difference Result 3830 states and 6471 transitions. [2018-09-26 08:09:14,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:09:14,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:09:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:14,684 INFO L225 Difference]: With dead ends: 3830 [2018-09-26 08:09:14,685 INFO L226 Difference]: Without dead ends: 3828 [2018-09-26 08:09:14,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:09:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2018-09-26 08:09:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3225. [2018-09-26 08:09:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3225 states. [2018-09-26 08:09:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 5464 transitions. [2018-09-26 08:09:16,604 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 5464 transitions. Word has length 21 [2018-09-26 08:09:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:16,605 INFO L480 AbstractCegarLoop]: Abstraction has 3225 states and 5464 transitions. [2018-09-26 08:09:16,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:09:16,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 5464 transitions. [2018-09-26 08:09:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:16,606 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:16,606 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:09:16,606 INFO L423 AbstractCegarLoop]: === Iteration 102 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:16,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash -790589419, now seen corresponding path program 4 times [2018-09-26 08:09:16,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:16,620 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:16,620 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:16,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:09:16,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:09:16,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:09:16,621 INFO L87 Difference]: Start difference. First operand 3225 states and 5464 transitions. Second operand 12 states. [2018-09-26 08:09:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:19,395 INFO L93 Difference]: Finished difference Result 3932 states and 6616 transitions. [2018-09-26 08:09:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:09:19,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:09:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:19,399 INFO L225 Difference]: With dead ends: 3932 [2018-09-26 08:09:19,399 INFO L226 Difference]: Without dead ends: 3930 [2018-09-26 08:09:19,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:09:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2018-09-26 08:09:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3379. [2018-09-26 08:09:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3379 states. [2018-09-26 08:09:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 5726 transitions. [2018-09-26 08:09:21,394 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 5726 transitions. Word has length 21 [2018-09-26 08:09:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:21,394 INFO L480 AbstractCegarLoop]: Abstraction has 3379 states and 5726 transitions. [2018-09-26 08:09:21,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:09:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 5726 transitions. [2018-09-26 08:09:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:21,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:21,395 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:09:21,395 INFO L423 AbstractCegarLoop]: === Iteration 103 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:21,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1656473859, now seen corresponding path program 1 times [2018-09-26 08:09:21,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:21,408 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:21,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:21,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:09:21,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:09:21,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:09:21,409 INFO L87 Difference]: Start difference. First operand 3379 states and 5726 transitions. Second operand 12 states. [2018-09-26 08:09:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:24,366 INFO L93 Difference]: Finished difference Result 4115 states and 6953 transitions. [2018-09-26 08:09:24,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:09:24,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:09:24,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:24,370 INFO L225 Difference]: With dead ends: 4115 [2018-09-26 08:09:24,370 INFO L226 Difference]: Without dead ends: 4113 [2018-09-26 08:09:24,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:09:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2018-09-26 08:09:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3490. [2018-09-26 08:09:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2018-09-26 08:09:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 5892 transitions. [2018-09-26 08:09:26,503 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 5892 transitions. Word has length 21 [2018-09-26 08:09:26,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:26,503 INFO L480 AbstractCegarLoop]: Abstraction has 3490 states and 5892 transitions. [2018-09-26 08:09:26,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:09:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 5892 transitions. [2018-09-26 08:09:26,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:26,504 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:26,504 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:09:26,504 INFO L423 AbstractCegarLoop]: === Iteration 104 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:26,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:26,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1656474147, now seen corresponding path program 5 times [2018-09-26 08:09:26,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:26,522 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:26,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:26,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:09:26,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:09:26,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:09:26,523 INFO L87 Difference]: Start difference. First operand 3490 states and 5892 transitions. Second operand 12 states. [2018-09-26 08:09:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:29,688 INFO L93 Difference]: Finished difference Result 4077 states and 6809 transitions. [2018-09-26 08:09:29,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:09:29,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:09:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:29,691 INFO L225 Difference]: With dead ends: 4077 [2018-09-26 08:09:29,691 INFO L226 Difference]: Without dead ends: 4075 [2018-09-26 08:09:29,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=357, Invalid=1203, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:09:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2018-09-26 08:09:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 3523. [2018-09-26 08:09:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2018-09-26 08:09:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 5952 transitions. [2018-09-26 08:09:31,790 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 5952 transitions. Word has length 21 [2018-09-26 08:09:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:31,790 INFO L480 AbstractCegarLoop]: Abstraction has 3523 states and 5952 transitions. [2018-09-26 08:09:31,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:09:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 5952 transitions. [2018-09-26 08:09:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:31,791 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:31,791 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:09:31,792 INFO L423 AbstractCegarLoop]: === Iteration 105 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:31,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:31,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1665062316, now seen corresponding path program 2 times [2018-09-26 08:09:31,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:31,807 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:31,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:31,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:09:31,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:09:31,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:09:31,807 INFO L87 Difference]: Start difference. First operand 3523 states and 5952 transitions. Second operand 13 states. [2018-09-26 08:09:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:35,089 INFO L93 Difference]: Finished difference Result 4708 states and 7968 transitions. [2018-09-26 08:09:35,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:09:35,090 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-09-26 08:09:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:35,093 INFO L225 Difference]: With dead ends: 4708 [2018-09-26 08:09:35,094 INFO L226 Difference]: Without dead ends: 4706 [2018-09-26 08:09:35,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:09:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4706 states. [2018-09-26 08:09:37,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4706 to 3926. [2018-09-26 08:09:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3926 states. [2018-09-26 08:09:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 6652 transitions. [2018-09-26 08:09:37,406 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 6652 transitions. Word has length 21 [2018-09-26 08:09:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:37,407 INFO L480 AbstractCegarLoop]: Abstraction has 3926 states and 6652 transitions. [2018-09-26 08:09:37,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:09:37,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 6652 transitions. [2018-09-26 08:09:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:37,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:37,408 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:37,408 INFO L423 AbstractCegarLoop]: === Iteration 106 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:37,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:37,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1944645353, now seen corresponding path program 1 times [2018-09-26 08:09:37,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:37,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:37,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:37,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:09:37,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:09:37,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:09:37,422 INFO L87 Difference]: Start difference. First operand 3926 states and 6652 transitions. Second operand 12 states. [2018-09-26 08:09:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:40,739 INFO L93 Difference]: Finished difference Result 4890 states and 8270 transitions. [2018-09-26 08:09:40,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:09:40,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:09:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:40,744 INFO L225 Difference]: With dead ends: 4890 [2018-09-26 08:09:40,744 INFO L226 Difference]: Without dead ends: 4888 [2018-09-26 08:09:40,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:09:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4888 states. [2018-09-26 08:09:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4888 to 4312. [2018-09-26 08:09:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4312 states. [2018-09-26 08:09:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 7318 transitions. [2018-09-26 08:09:43,276 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 7318 transitions. Word has length 21 [2018-09-26 08:09:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:43,276 INFO L480 AbstractCegarLoop]: Abstraction has 4312 states and 7318 transitions. [2018-09-26 08:09:43,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:09:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 7318 transitions. [2018-09-26 08:09:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:43,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:43,278 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:43,278 INFO L423 AbstractCegarLoop]: === Iteration 107 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:43,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash 502417925, now seen corresponding path program 1 times [2018-09-26 08:09:43,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:43,291 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:43,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:43,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:09:43,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:09:43,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:09:43,292 INFO L87 Difference]: Start difference. First operand 4312 states and 7318 transitions. Second operand 12 states. [2018-09-26 08:09:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:46,798 INFO L93 Difference]: Finished difference Result 5047 states and 8540 transitions. [2018-09-26 08:09:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:09:46,798 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:09:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:46,804 INFO L225 Difference]: With dead ends: 5047 [2018-09-26 08:09:46,804 INFO L226 Difference]: Without dead ends: 5045 [2018-09-26 08:09:46,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:09:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2018-09-26 08:09:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 4470. [2018-09-26 08:09:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4470 states. [2018-09-26 08:09:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 7567 transitions. [2018-09-26 08:09:49,438 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 7567 transitions. Word has length 21 [2018-09-26 08:09:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:49,438 INFO L480 AbstractCegarLoop]: Abstraction has 4470 states and 7567 transitions. [2018-09-26 08:09:49,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:09:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 7567 transitions. [2018-09-26 08:09:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:49,439 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:49,439 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:49,440 INFO L423 AbstractCegarLoop]: === Iteration 108 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:49,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:49,440 INFO L82 PathProgramCache]: Analyzing trace with hash 502418213, now seen corresponding path program 2 times [2018-09-26 08:09:49,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:49,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:49,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:49,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:09:49,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:09:49,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:09:49,451 INFO L87 Difference]: Start difference. First operand 4470 states and 7567 transitions. Second operand 12 states. [2018-09-26 08:09:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:53,000 INFO L93 Difference]: Finished difference Result 5152 states and 8677 transitions. [2018-09-26 08:09:53,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:09:53,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:09:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:53,005 INFO L225 Difference]: With dead ends: 5152 [2018-09-26 08:09:53,006 INFO L226 Difference]: Without dead ends: 5150 [2018-09-26 08:09:53,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:09:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2018-09-26 08:09:55,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 4477. [2018-09-26 08:09:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4477 states. [2018-09-26 08:09:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 7584 transitions. [2018-09-26 08:09:55,662 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 7584 transitions. Word has length 21 [2018-09-26 08:09:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:55,662 INFO L480 AbstractCegarLoop]: Abstraction has 4477 states and 7584 transitions. [2018-09-26 08:09:55,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:09:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 7584 transitions. [2018-09-26 08:09:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:09:55,664 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:55,664 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:55,664 INFO L423 AbstractCegarLoop]: === Iteration 109 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:55,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash 511006382, now seen corresponding path program 2 times [2018-09-26 08:09:55,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:55,678 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:55,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:55,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:09:55,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:09:55,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:09:55,679 INFO L87 Difference]: Start difference. First operand 4477 states and 7584 transitions. Second operand 13 states. [2018-09-26 08:09:59,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:59,398 INFO L93 Difference]: Finished difference Result 5562 states and 9455 transitions. [2018-09-26 08:09:59,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:09:59,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-09-26 08:09:59,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:59,404 INFO L225 Difference]: With dead ends: 5562 [2018-09-26 08:09:59,405 INFO L226 Difference]: Without dead ends: 5560 [2018-09-26 08:09:59,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:09:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states. [2018-09-26 08:10:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 4895. [2018-09-26 08:10:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4895 states. [2018-09-26 08:10:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 8338 transitions. [2018-09-26 08:10:02,305 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 8338 transitions. Word has length 21 [2018-09-26 08:10:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:02,305 INFO L480 AbstractCegarLoop]: Abstraction has 4895 states and 8338 transitions. [2018-09-26 08:10:02,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:10:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 8338 transitions. [2018-09-26 08:10:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:10:02,307 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:02,307 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:02,307 INFO L423 AbstractCegarLoop]: === Iteration 110 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:02,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:02,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1892744866, now seen corresponding path program 1 times [2018-09-26 08:10:02,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:02,321 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:02,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:02,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:02,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:02,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:02,321 INFO L87 Difference]: Start difference. First operand 4895 states and 8338 transitions. Second operand 12 states. [2018-09-26 08:10:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:06,148 INFO L93 Difference]: Finished difference Result 5795 states and 9885 transitions. [2018-09-26 08:10:06,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:10:06,148 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:10:06,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:06,154 INFO L225 Difference]: With dead ends: 5795 [2018-09-26 08:10:06,154 INFO L226 Difference]: Without dead ends: 5793 [2018-09-26 08:10:06,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:10:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states. [2018-09-26 08:10:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5793 to 5351. [2018-09-26 08:10:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5351 states. [2018-09-26 08:10:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5351 states to 5351 states and 9168 transitions. [2018-09-26 08:10:09,429 INFO L78 Accepts]: Start accepts. Automaton has 5351 states and 9168 transitions. Word has length 21 [2018-09-26 08:10:09,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:09,429 INFO L480 AbstractCegarLoop]: Abstraction has 5351 states and 9168 transitions. [2018-09-26 08:10:09,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5351 states and 9168 transitions. [2018-09-26 08:10:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:10:09,430 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:09,430 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:10:09,431 INFO L423 AbstractCegarLoop]: === Iteration 111 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:09,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1195981155, now seen corresponding path program 3 times [2018-09-26 08:10:09,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:09,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:09,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:09,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:09,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:09,447 INFO L87 Difference]: Start difference. First operand 5351 states and 9168 transitions. Second operand 12 states. [2018-09-26 08:10:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:13,704 INFO L93 Difference]: Finished difference Result 6216 states and 10633 transitions. [2018-09-26 08:10:13,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:10:13,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:10:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:13,709 INFO L225 Difference]: With dead ends: 6216 [2018-09-26 08:10:13,710 INFO L226 Difference]: Without dead ends: 6214 [2018-09-26 08:10:13,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:10:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2018-09-26 08:10:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 5792. [2018-09-26 08:10:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5792 states. [2018-09-26 08:10:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5792 states to 5792 states and 9945 transitions. [2018-09-26 08:10:17,157 INFO L78 Accepts]: Start accepts. Automaton has 5792 states and 9945 transitions. Word has length 21 [2018-09-26 08:10:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:17,157 INFO L480 AbstractCegarLoop]: Abstraction has 5792 states and 9945 transitions. [2018-09-26 08:10:17,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5792 states and 9945 transitions. [2018-09-26 08:10:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:10:17,159 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:17,159 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:17,159 INFO L423 AbstractCegarLoop]: === Iteration 112 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:17,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1244712345, now seen corresponding path program 1 times [2018-09-26 08:10:17,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:10:17,220 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:17,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:17,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:17,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:17,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:17,221 INFO L87 Difference]: Start difference. First operand 5792 states and 9945 transitions. Second operand 12 states. [2018-09-26 08:10:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:22,223 INFO L93 Difference]: Finished difference Result 6775 states and 11608 transitions. [2018-09-26 08:10:22,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:10:22,223 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:10:22,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:22,229 INFO L225 Difference]: With dead ends: 6775 [2018-09-26 08:10:22,229 INFO L226 Difference]: Without dead ends: 6773 [2018-09-26 08:10:22,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=408, Invalid=1232, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:10:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2018-09-26 08:10:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 5546. [2018-09-26 08:10:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5546 states. [2018-09-26 08:10:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5546 states to 5546 states and 9498 transitions. [2018-09-26 08:10:25,916 INFO L78 Accepts]: Start accepts. Automaton has 5546 states and 9498 transitions. Word has length 21 [2018-09-26 08:10:25,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:25,916 INFO L480 AbstractCegarLoop]: Abstraction has 5546 states and 9498 transitions. [2018-09-26 08:10:25,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 5546 states and 9498 transitions. [2018-09-26 08:10:25,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:10:25,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:25,918 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:10:25,918 INFO L423 AbstractCegarLoop]: === Iteration 113 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:25,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:25,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2122062335, now seen corresponding path program 6 times [2018-09-26 08:10:25,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:25,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:25,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:25,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:25,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:25,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:25,935 INFO L87 Difference]: Start difference. First operand 5546 states and 9498 transitions. Second operand 12 states. [2018-09-26 08:10:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:31,939 INFO L93 Difference]: Finished difference Result 7993 states and 13790 transitions. [2018-09-26 08:10:31,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:10:31,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:10:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:31,945 INFO L225 Difference]: With dead ends: 7993 [2018-09-26 08:10:31,946 INFO L226 Difference]: Without dead ends: 7991 [2018-09-26 08:10:31,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:10:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states. [2018-09-26 08:10:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 6894. [2018-09-26 08:10:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6894 states. [2018-09-26 08:10:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11875 transitions. [2018-09-26 08:10:36,264 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11875 transitions. Word has length 21 [2018-09-26 08:10:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,264 INFO L480 AbstractCegarLoop]: Abstraction has 6894 states and 11875 transitions. [2018-09-26 08:10:36,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11875 transitions. [2018-09-26 08:10:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:10:36,266 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,266 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:10:36,266 INFO L423 AbstractCegarLoop]: === Iteration 114 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash 274158317, now seen corresponding path program 3 times [2018-09-26 08:10:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:36,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:36,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:36,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:36,282 INFO L87 Difference]: Start difference. First operand 6894 states and 11875 transitions. Second operand 12 states. [2018-09-26 08:10:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:42,783 INFO L93 Difference]: Finished difference Result 8437 states and 14562 transitions. [2018-09-26 08:10:42,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:10:42,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:10:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:42,792 INFO L225 Difference]: With dead ends: 8437 [2018-09-26 08:10:42,792 INFO L226 Difference]: Without dead ends: 8435 [2018-09-26 08:10:42,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:10:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8435 states. [2018-09-26 08:10:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8435 to 7260. [2018-09-26 08:10:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states. [2018-09-26 08:10:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 12485 transitions. [2018-09-26 08:10:47,356 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 12485 transitions. Word has length 21 [2018-09-26 08:10:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:47,356 INFO L480 AbstractCegarLoop]: Abstraction has 7260 states and 12485 transitions. [2018-09-26 08:10:47,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 12485 transitions. [2018-09-26 08:10:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:10:47,358 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:47,358 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:10:47,358 INFO L423 AbstractCegarLoop]: === Iteration 115 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:47,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:47,359 INFO L82 PathProgramCache]: Analyzing trace with hash 274158605, now seen corresponding path program 7 times [2018-09-26 08:10:47,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:47,370 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:47,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:47,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:47,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:47,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:47,371 INFO L87 Difference]: Start difference. First operand 7260 states and 12485 transitions. Second operand 12 states. [2018-09-26 08:10:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,138 INFO L93 Difference]: Finished difference Result 8575 states and 14718 transitions. [2018-09-26 08:10:54,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:10:54,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:10:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,146 INFO L225 Difference]: With dead ends: 8575 [2018-09-26 08:10:54,147 INFO L226 Difference]: Without dead ends: 8573 [2018-09-26 08:10:54,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:10:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8573 states. [2018-09-26 08:10:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8573 to 7185. [2018-09-26 08:10:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7185 states. [2018-09-26 08:10:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 12367 transitions. [2018-09-26 08:10:58,855 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 12367 transitions. Word has length 21 [2018-09-26 08:10:58,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:58,855 INFO L480 AbstractCegarLoop]: Abstraction has 7185 states and 12367 transitions. [2018-09-26 08:10:58,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 12367 transitions. [2018-09-26 08:10:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:10:58,857 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:58,857 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:10:58,857 INFO L423 AbstractCegarLoop]: === Iteration 116 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:58,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:58,857 INFO L82 PathProgramCache]: Analyzing trace with hash 282746774, now seen corresponding path program 4 times [2018-09-26 08:10:58,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:58,871 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:58,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:58,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:58,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:58,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:58,871 INFO L87 Difference]: Start difference. First operand 7185 states and 12367 transitions. Second operand 12 states. [2018-09-26 08:11:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:05,559 INFO L93 Difference]: Finished difference Result 9004 states and 15545 transitions. [2018-09-26 08:11:05,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:11:05,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:11:05,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:05,569 INFO L225 Difference]: With dead ends: 9004 [2018-09-26 08:11:05,569 INFO L226 Difference]: Without dead ends: 9002 [2018-09-26 08:11:05,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:11:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9002 states. [2018-09-26 08:11:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9002 to 8158. [2018-09-26 08:11:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8158 states. [2018-09-26 08:11:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 14063 transitions. [2018-09-26 08:11:10,713 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 14063 transitions. Word has length 21 [2018-09-26 08:11:10,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:10,714 INFO L480 AbstractCegarLoop]: Abstraction has 8158 states and 14063 transitions. [2018-09-26 08:11:10,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:11:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 14063 transitions. [2018-09-26 08:11:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:11:10,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:10,715 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:11:10,716 INFO L423 AbstractCegarLoop]: === Iteration 117 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:10,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:10,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2121004474, now seen corresponding path program 1 times [2018-09-26 08:11:10,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:10,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:10,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:11:10,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:11:10,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:11:10,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:11:10,729 INFO L87 Difference]: Start difference. First operand 8158 states and 14063 transitions. Second operand 12 states. Received shutdown request... [2018-09-26 08:11:10,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:11:10,886 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:11:10,892 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:11:10,892 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:11:10 BoogieIcfgContainer [2018-09-26 08:11:10,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:11:10,894 INFO L168 Benchmark]: Toolchain (without parser) took 256479.45 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:11:10,895 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:11:10,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:11:10,896 INFO L168 Benchmark]: Boogie Preprocessor took 22.78 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:11:10,896 INFO L168 Benchmark]: RCFGBuilder took 297.83 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:11:10,897 INFO L168 Benchmark]: TraceAbstraction took 256109.72 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:11:10,900 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.21 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 43.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.78 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 297.83 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 256109.72 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 78). Cancelled while BasicCegarLoop was constructing difference of abstraction (8158states) and FLOYD_HOARE automaton (currently 7 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (68 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (8158states) and FLOYD_HOARE automaton (currently 7 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (68 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (8158states) and FLOYD_HOARE automaton (currently 7 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (68 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (8158states) and FLOYD_HOARE automaton (currently 7 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (68 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 256.0s OverallTime, 117 OverallIterations, 4 TraceHistogramMax, 147.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4248 SDtfs, 10909 SDslu, 9268 SDs, 0 SdLazy, 61549 SolverSat, 5414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2566 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 2471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12307 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8158occurred in iteration=116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 105.8s AutomataMinimizationTime, 116 MinimizatonAttempts, 24449 StatesRemovedByMinimization, 116 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1792 NumberOfCodeBlocks, 1792 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 1675 ConstructedInterpolants, 0 QuantifiedInterpolants, 172780 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 117 InterpolantComputations, 7 PerfectInterpolantSequences, 135/1170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-11-10-910.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-11-10-910.csv Completed graceful shutdown